/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/mix005_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-0612a5f-m [2022-09-20 20:29:32,719 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 20:29:32,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 20:29:32,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 20:29:32,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 20:29:32,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 20:29:32,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 20:29:32,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 20:29:32,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 20:29:32,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 20:29:32,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 20:29:32,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 20:29:32,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 20:29:32,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 20:29:32,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 20:29:32,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 20:29:32,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 20:29:32,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 20:29:32,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 20:29:32,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 20:29:32,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 20:29:32,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 20:29:32,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 20:29:32,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 20:29:32,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 20:29:32,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 20:29:32,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 20:29:32,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 20:29:32,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 20:29:32,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 20:29:32,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 20:29:32,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 20:29:32,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 20:29:32,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 20:29:32,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 20:29:32,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 20:29:32,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 20:29:32,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 20:29:32,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 20:29:32,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 20:29:32,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 20:29:32,807 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-09-20 20:29:32,830 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 20:29:32,831 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 20:29:32,832 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 20:29:32,832 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 20:29:32,832 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 20:29:32,832 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 20:29:32,832 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 20:29:32,832 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 20:29:32,832 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 20:29:32,833 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 20:29:32,833 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 20:29:32,833 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 20:29:32,833 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 20:29:32,833 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 20:29:32,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 20:29:32,833 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 20:29:32,834 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 20:29:32,834 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 20:29:32,834 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 20:29:32,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 20:29:32,834 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 20:29:32,834 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 20:29:32,834 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 20:29:32,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 20:29:32,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 20:29:32,834 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 20:29:32,834 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 20:29:32,834 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 20:29:32,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 20:29:32,835 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 20:29:32,836 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 20:29:32,836 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-09-20 20:29:33,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 20:29:33,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 20:29:33,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 20:29:33,040 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 20:29:33,042 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 20:29:33,043 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2022-09-20 20:29:33,120 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f59f225c1/533af27657704496a534169a2f1e0235/FLAGf09afa5d4 [2022-09-20 20:29:33,475 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 20:29:33,475 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2022-09-20 20:29:33,493 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f59f225c1/533af27657704496a534169a2f1e0235/FLAGf09afa5d4 [2022-09-20 20:29:33,836 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f59f225c1/533af27657704496a534169a2f1e0235 [2022-09-20 20:29:33,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 20:29:33,838 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 20:29:33,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 20:29:33,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 20:29:33,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 20:29:33,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:29:33" (1/1) ... [2022-09-20 20:29:33,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@278a9f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:29:33, skipping insertion in model container [2022-09-20 20:29:33,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:29:33" (1/1) ... [2022-09-20 20:29:33,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 20:29:33,900 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 20:29:34,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i[949,962] [2022-09-20 20:29:34,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 20:29:34,176 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 20:29:34,186 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i[949,962] [2022-09-20 20:29:34,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 20:29:34,258 INFO L208 MainTranslator]: Completed translation [2022-09-20 20:29:34,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:29:34 WrapperNode [2022-09-20 20:29:34,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 20:29:34,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 20:29:34,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 20:29:34,260 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 20:29:34,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:29:34" (1/1) ... [2022-09-20 20:29:34,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:29:34" (1/1) ... [2022-09-20 20:29:34,312 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 293 [2022-09-20 20:29:34,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 20:29:34,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 20:29:34,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 20:29:34,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 20:29:34,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:29:34" (1/1) ... [2022-09-20 20:29:34,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:29:34" (1/1) ... [2022-09-20 20:29:34,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:29:34" (1/1) ... [2022-09-20 20:29:34,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:29:34" (1/1) ... [2022-09-20 20:29:34,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:29:34" (1/1) ... [2022-09-20 20:29:34,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:29:34" (1/1) ... [2022-09-20 20:29:34,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:29:34" (1/1) ... [2022-09-20 20:29:34,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 20:29:34,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 20:29:34,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 20:29:34,349 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 20:29:34,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:29:34" (1/1) ... [2022-09-20 20:29:34,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 20:29:34,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 20:29:34,411 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-09-20 20:29:34,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-20 20:29:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 20:29:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 20:29:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 20:29:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 20:29:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 20:29:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-09-20 20:29:34,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-09-20 20:29:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-09-20 20:29:34,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-09-20 20:29:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-09-20 20:29:34,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-09-20 20:29:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-09-20 20:29:34,443 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-09-20 20:29:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 20:29:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 20:29:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 20:29:34,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 20:29:34,444 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 20:29:34,532 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 20:29:34,533 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 20:29:34,984 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 20:29:35,217 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 20:29:35,217 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-20 20:29:35,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:29:35 BoogieIcfgContainer [2022-09-20 20:29:35,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 20:29:35,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 20:29:35,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 20:29:35,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 20:29:35,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 08:29:33" (1/3) ... [2022-09-20 20:29:35,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba032b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:29:35, skipping insertion in model container [2022-09-20 20:29:35,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:29:34" (2/3) ... [2022-09-20 20:29:35,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba032b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:29:35, skipping insertion in model container [2022-09-20 20:29:35,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:29:35" (3/3) ... [2022-09-20 20:29:35,227 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2022-09-20 20:29:35,239 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 20:29:35,240 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-09-20 20:29:35,240 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 20:29:35,289 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-20 20:29:35,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2022-09-20 20:29:35,381 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2022-09-20 20:29:35,381 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 20:29:35,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-09-20 20:29:35,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 140 transitions, 300 flow [2022-09-20 20:29:35,391 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 136 transitions, 284 flow [2022-09-20 20:29:35,401 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 20:29:35,407 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;@534067c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 20:29:35,407 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-09-20 20:29:35,422 INFO L130 PetriNetUnfolder]: 0/65 cut-off events. [2022-09-20 20:29:35,423 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 20:29:35,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:29:35,424 INFO L208 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] [2022-09-20 20:29:35,424 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:29:35,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:29:35,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1996518298, now seen corresponding path program 1 times [2022-09-20 20:29:35,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:29:35,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362513138] [2022-09-20 20:29:35,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:29:35,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:29:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:29:35,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:29:35,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:29:35,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362513138] [2022-09-20 20:29:35,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362513138] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:29:35,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:29:35,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 20:29:35,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128885561] [2022-09-20 20:29:35,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:29:35,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 20:29:35,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:29:35,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 20:29:35,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 20:29:35,772 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 140 [2022-09-20 20:29:35,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 136 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 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-09-20 20:29:35,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:29:35,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 140 [2022-09-20 20:29:35,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:29:36,034 INFO L130 PetriNetUnfolder]: 161/1036 cut-off events. [2022-09-20 20:29:36,034 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-09-20 20:29:36,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 1036 events. 161/1036 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 6998 event pairs, 103 based on Foata normal form. 35/1013 useless extension candidates. Maximal degree in co-relation 1279. Up to 187 conditions per place. [2022-09-20 20:29:36,047 INFO L137 encePairwiseOnDemand]: 135/140 looper letters, 17 selfloop transitions, 2 changer transitions 0/139 dead transitions. [2022-09-20 20:29:36,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 139 transitions, 334 flow [2022-09-20 20:29:36,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 20:29:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 20:29:36,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2022-09-20 20:29:36,062 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9428571428571428 [2022-09-20 20:29:36,062 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2022-09-20 20:29:36,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2022-09-20 20:29:36,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:29:36,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2022-09-20 20:29:36,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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-09-20 20:29:36,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 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-09-20 20:29:36,077 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 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-09-20 20:29:36,078 INFO L175 Difference]: Start difference. First operand has 147 places, 136 transitions, 284 flow. Second operand 3 states and 396 transitions. [2022-09-20 20:29:36,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 139 transitions, 334 flow [2022-09-20 20:29:36,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 139 transitions, 328 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-09-20 20:29:36,086 INFO L231 Difference]: Finished difference. Result has 143 places, 132 transitions, 276 flow [2022-09-20 20:29:36,087 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=143, PETRI_TRANSITIONS=132} [2022-09-20 20:29:36,091 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, -4 predicate places. [2022-09-20 20:29:36,091 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 132 transitions, 276 flow [2022-09-20 20:29:36,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 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-09-20 20:29:36,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:29:36,092 INFO L208 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, 1, 1, 1, 1] [2022-09-20 20:29:36,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 20:29:36,092 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:29:36,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:29:36,092 INFO L85 PathProgramCache]: Analyzing trace with hash -583916909, now seen corresponding path program 1 times [2022-09-20 20:29:36,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:29:36,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556295661] [2022-09-20 20:29:36,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:29:36,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:29:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:29:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:29:36,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:29:36,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556295661] [2022-09-20 20:29:36,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556295661] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:29:36,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:29:36,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:29:36,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137955431] [2022-09-20 20:29:36,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:29:36,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:29:36,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:29:36,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:29:36,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:29:36,379 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 140 [2022-09-20 20:29:36,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 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-09-20 20:29:36,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:29:36,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 140 [2022-09-20 20:29:36,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:29:36,942 INFO L130 PetriNetUnfolder]: 869/2454 cut-off events. [2022-09-20 20:29:36,943 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-09-20 20:29:36,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3925 conditions, 2454 events. 869/2454 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 19511 event pairs, 129 based on Foata normal form. 0/2397 useless extension candidates. Maximal degree in co-relation 3867. Up to 609 conditions per place. [2022-09-20 20:29:36,956 INFO L137 encePairwiseOnDemand]: 134/140 looper letters, 21 selfloop transitions, 2 changer transitions 53/176 dead transitions. [2022-09-20 20:29:36,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 176 transitions, 504 flow [2022-09-20 20:29:36,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:29:36,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:29:36,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1118 transitions. [2022-09-20 20:29:36,959 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8873015873015873 [2022-09-20 20:29:36,959 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1118 transitions. [2022-09-20 20:29:36,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1118 transitions. [2022-09-20 20:29:36,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:29:36,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1118 transitions. [2022-09-20 20:29:36,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.22222222222223) internal successors, (1118), 9 states have internal predecessors, (1118), 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-09-20 20:29:36,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 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-09-20 20:29:36,964 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 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-09-20 20:29:36,964 INFO L175 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 9 states and 1118 transitions. [2022-09-20 20:29:36,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 176 transitions, 504 flow [2022-09-20 20:29:36,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 176 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 20:29:36,968 INFO L231 Difference]: Finished difference. Result has 156 places, 118 transitions, 264 flow [2022-09-20 20:29:36,968 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=264, PETRI_PLACES=156, PETRI_TRANSITIONS=118} [2022-09-20 20:29:36,969 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 9 predicate places. [2022-09-20 20:29:36,970 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 118 transitions, 264 flow [2022-09-20 20:29:36,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 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-09-20 20:29:36,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:29:36,970 INFO L208 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, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:29:36,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 20:29:36,971 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:29:36,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:29:36,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1362219406, now seen corresponding path program 1 times [2022-09-20 20:29:36,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:29:36,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436907683] [2022-09-20 20:29:36,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:29:36,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:29:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:29:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:29:37,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:29:37,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436907683] [2022-09-20 20:29:37,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436907683] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:29:37,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:29:37,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:29:37,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217261264] [2022-09-20 20:29:37,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:29:37,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:29:37,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:29:37,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:29:37,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:29:37,148 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 140 [2022-09-20 20:29:37,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 118 transitions, 264 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 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-09-20 20:29:37,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:29:37,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 140 [2022-09-20 20:29:37,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:29:37,497 INFO L130 PetriNetUnfolder]: 746/1607 cut-off events. [2022-09-20 20:29:37,498 INFO L131 PetriNetUnfolder]: For 329/329 co-relation queries the response was YES. [2022-09-20 20:29:37,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3122 conditions, 1607 events. 746/1607 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10056 event pairs, 200 based on Foata normal form. 36/1589 useless extension candidates. Maximal degree in co-relation 3057. Up to 571 conditions per place. [2022-09-20 20:29:37,508 INFO L137 encePairwiseOnDemand]: 134/140 looper letters, 22 selfloop transitions, 2 changer transitions 37/161 dead transitions. [2022-09-20 20:29:37,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 161 transitions, 492 flow [2022-09-20 20:29:37,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:29:37,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:29:37,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1116 transitions. [2022-09-20 20:29:37,511 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8857142857142857 [2022-09-20 20:29:37,511 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1116 transitions. [2022-09-20 20:29:37,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1116 transitions. [2022-09-20 20:29:37,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:29:37,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1116 transitions. [2022-09-20 20:29:37,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.0) internal successors, (1116), 9 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-09-20 20:29:37,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 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-09-20 20:29:37,516 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 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-09-20 20:29:37,516 INFO L175 Difference]: Start difference. First operand has 156 places, 118 transitions, 264 flow. Second operand 9 states and 1116 transitions. [2022-09-20 20:29:37,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 161 transitions, 492 flow [2022-09-20 20:29:37,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 161 transitions, 460 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-09-20 20:29:37,523 INFO L231 Difference]: Finished difference. Result has 143 places, 118 transitions, 268 flow [2022-09-20 20:29:37,524 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=268, PETRI_PLACES=143, PETRI_TRANSITIONS=118} [2022-09-20 20:29:37,524 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, -4 predicate places. [2022-09-20 20:29:37,524 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 118 transitions, 268 flow [2022-09-20 20:29:37,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 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-09-20 20:29:37,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:29:37,525 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:29:37,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 20:29:37,525 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:29:37,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:29:37,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1294539535, now seen corresponding path program 1 times [2022-09-20 20:29:37,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:29:37,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686380219] [2022-09-20 20:29:37,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:29:37,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:29:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:29:37,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:29:37,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:29:37,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686380219] [2022-09-20 20:29:37,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686380219] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:29:37,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:29:37,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 20:29:37,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999281097] [2022-09-20 20:29:37,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:29:37,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 20:29:37,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:29:37,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 20:29:37,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-09-20 20:29:37,760 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2022-09-20 20:29:37,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 118 transitions, 268 flow. Second operand has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 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-09-20 20:29:37,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:29:37,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2022-09-20 20:29:37,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:29:38,153 INFO L130 PetriNetUnfolder]: 862/1778 cut-off events. [2022-09-20 20:29:38,153 INFO L131 PetriNetUnfolder]: For 461/461 co-relation queries the response was YES. [2022-09-20 20:29:38,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3557 conditions, 1778 events. 862/1778 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10804 event pairs, 320 based on Foata normal form. 36/1778 useless extension candidates. Maximal degree in co-relation 3489. Up to 822 conditions per place. [2022-09-20 20:29:38,165 INFO L137 encePairwiseOnDemand]: 129/140 looper letters, 22 selfloop transitions, 7 changer transitions 40/167 dead transitions. [2022-09-20 20:29:38,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 167 transitions, 530 flow [2022-09-20 20:29:38,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 20:29:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 20:29:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1336 transitions. [2022-09-20 20:29:38,168 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8675324675324675 [2022-09-20 20:29:38,169 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1336 transitions. [2022-09-20 20:29:38,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1336 transitions. [2022-09-20 20:29:38,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:29:38,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1336 transitions. [2022-09-20 20:29:38,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 121.45454545454545) internal successors, (1336), 11 states have internal predecessors, (1336), 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-09-20 20:29:38,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 140.0) internal successors, (1680), 12 states have internal predecessors, (1680), 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-09-20 20:29:38,174 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 140.0) internal successors, (1680), 12 states have internal predecessors, (1680), 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-09-20 20:29:38,174 INFO L175 Difference]: Start difference. First operand has 143 places, 118 transitions, 268 flow. Second operand 11 states and 1336 transitions. [2022-09-20 20:29:38,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 167 transitions, 530 flow [2022-09-20 20:29:38,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 167 transitions, 498 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-09-20 20:29:38,182 INFO L231 Difference]: Finished difference. Result has 146 places, 122 transitions, 325 flow [2022-09-20 20:29:38,183 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=325, PETRI_PLACES=146, PETRI_TRANSITIONS=122} [2022-09-20 20:29:38,183 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, -1 predicate places. [2022-09-20 20:29:38,183 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 122 transitions, 325 flow [2022-09-20 20:29:38,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 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-09-20 20:29:38,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:29:38,184 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:29:38,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 20:29:38,184 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:29:38,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:29:38,184 INFO L85 PathProgramCache]: Analyzing trace with hash 369886138, now seen corresponding path program 1 times [2022-09-20 20:29:38,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:29:38,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642070672] [2022-09-20 20:29:38,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:29:38,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:29:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:29:38,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:29:38,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:29:38,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642070672] [2022-09-20 20:29:38,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642070672] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:29:38,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:29:38,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:29:38,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62631511] [2022-09-20 20:29:38,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:29:38,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:29:38,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:29:38,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:29:38,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:29:38,284 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 140 [2022-09-20 20:29:38,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 122 transitions, 325 flow. Second operand has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 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-09-20 20:29:38,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:29:38,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 140 [2022-09-20 20:29:38,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:29:38,893 INFO L130 PetriNetUnfolder]: 1836/3690 cut-off events. [2022-09-20 20:29:38,893 INFO L131 PetriNetUnfolder]: For 7741/7741 co-relation queries the response was YES. [2022-09-20 20:29:38,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11771 conditions, 3690 events. 1836/3690 cut-off events. For 7741/7741 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 27027 event pairs, 272 based on Foata normal form. 34/3665 useless extension candidates. Maximal degree in co-relation 11701. Up to 1234 conditions per place. [2022-09-20 20:29:38,924 INFO L137 encePairwiseOnDemand]: 134/140 looper letters, 43 selfloop transitions, 2 changer transitions 20/163 dead transitions. [2022-09-20 20:29:38,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 163 transitions, 691 flow [2022-09-20 20:29:38,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 20:29:38,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 20:29:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 856 transitions. [2022-09-20 20:29:38,927 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8734693877551021 [2022-09-20 20:29:38,927 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 856 transitions. [2022-09-20 20:29:38,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 856 transitions. [2022-09-20 20:29:38,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:29:38,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 856 transitions. [2022-09-20 20:29:38,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 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-09-20 20:29:38,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 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-09-20 20:29:38,931 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 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-09-20 20:29:38,931 INFO L175 Difference]: Start difference. First operand has 146 places, 122 transitions, 325 flow. Second operand 7 states and 856 transitions. [2022-09-20 20:29:38,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 163 transitions, 691 flow [2022-09-20 20:29:38,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 163 transitions, 661 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-09-20 20:29:38,944 INFO L231 Difference]: Finished difference. Result has 145 places, 123 transitions, 329 flow [2022-09-20 20:29:38,944 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=329, PETRI_PLACES=145, PETRI_TRANSITIONS=123} [2022-09-20 20:29:38,946 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, -2 predicate places. [2022-09-20 20:29:38,946 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 123 transitions, 329 flow [2022-09-20 20:29:38,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 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-09-20 20:29:38,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:29:38,947 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:29:38,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 20:29:38,947 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:29:38,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:29:38,948 INFO L85 PathProgramCache]: Analyzing trace with hash -391007876, now seen corresponding path program 2 times [2022-09-20 20:29:38,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:29:38,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379714045] [2022-09-20 20:29:38,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:29:38,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:29:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:29:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:29:39,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:29:39,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379714045] [2022-09-20 20:29:39,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379714045] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:29:39,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:29:39,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-20 20:29:39,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922797832] [2022-09-20 20:29:39,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:29:39,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-20 20:29:39,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:29:39,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-20 20:29:39,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-09-20 20:29:39,236 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2022-09-20 20:29:39,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 123 transitions, 329 flow. Second operand has 12 states, 12 states have (on average 114.41666666666667) internal successors, (1373), 12 states have internal predecessors, (1373), 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-09-20 20:29:39,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:29:39,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2022-09-20 20:29:39,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:29:39,807 INFO L130 PetriNetUnfolder]: 1097/2385 cut-off events. [2022-09-20 20:29:39,807 INFO L131 PetriNetUnfolder]: For 5645/6048 co-relation queries the response was YES. [2022-09-20 20:29:39,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8012 conditions, 2385 events. 1097/2385 cut-off events. For 5645/6048 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 16378 event pairs, 763 based on Foata normal form. 20/2294 useless extension candidates. Maximal degree in co-relation 7939. Up to 1426 conditions per place. [2022-09-20 20:29:39,823 INFO L137 encePairwiseOnDemand]: 128/140 looper letters, 23 selfloop transitions, 11 changer transitions 34/165 dead transitions. [2022-09-20 20:29:39,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 165 transitions, 747 flow [2022-09-20 20:29:39,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 20:29:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 20:29:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1536 transitions. [2022-09-20 20:29:39,826 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.843956043956044 [2022-09-20 20:29:39,826 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1536 transitions. [2022-09-20 20:29:39,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1536 transitions. [2022-09-20 20:29:39,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:29:39,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1536 transitions. [2022-09-20 20:29:39,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 118.15384615384616) internal successors, (1536), 13 states have internal predecessors, (1536), 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-09-20 20:29:39,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-09-20 20:29:39,831 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-09-20 20:29:39,831 INFO L175 Difference]: Start difference. First operand has 145 places, 123 transitions, 329 flow. Second operand 13 states and 1536 transitions. [2022-09-20 20:29:39,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 165 transitions, 747 flow [2022-09-20 20:29:39,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 165 transitions, 732 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-09-20 20:29:39,838 INFO L231 Difference]: Finished difference. Result has 157 places, 126 transitions, 419 flow [2022-09-20 20:29:39,838 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=419, PETRI_PLACES=157, PETRI_TRANSITIONS=126} [2022-09-20 20:29:39,839 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 10 predicate places. [2022-09-20 20:29:39,839 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 126 transitions, 419 flow [2022-09-20 20:29:39,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 114.41666666666667) internal successors, (1373), 12 states have internal predecessors, (1373), 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-09-20 20:29:39,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:29:39,840 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:29:39,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 20:29:39,840 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:29:39,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:29:39,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1543003648, now seen corresponding path program 1 times [2022-09-20 20:29:39,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:29:39,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551586675] [2022-09-20 20:29:39,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:29:39,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:29:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:29:40,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:29:40,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:29:40,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551586675] [2022-09-20 20:29:40,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551586675] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:29:40,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:29:40,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-09-20 20:29:40,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008451232] [2022-09-20 20:29:40,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:29:40,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-09-20 20:29:40,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:29:40,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-09-20 20:29:40,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-09-20 20:29:40,047 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 140 [2022-09-20 20:29:40,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 126 transitions, 419 flow. Second operand has 13 states, 13 states have (on average 113.38461538461539) internal successors, (1474), 13 states have internal predecessors, (1474), 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-09-20 20:29:40,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:29:40,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 140 [2022-09-20 20:29:40,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:29:40,668 INFO L130 PetriNetUnfolder]: 1207/2638 cut-off events. [2022-09-20 20:29:40,668 INFO L131 PetriNetUnfolder]: For 16219/16472 co-relation queries the response was YES. [2022-09-20 20:29:40,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11568 conditions, 2638 events. 1207/2638 cut-off events. For 16219/16472 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 18994 event pairs, 705 based on Foata normal form. 52/2610 useless extension candidates. Maximal degree in co-relation 11485. Up to 1375 conditions per place. [2022-09-20 20:29:40,697 INFO L137 encePairwiseOnDemand]: 125/140 looper letters, 36 selfloop transitions, 20 changer transitions 43/195 dead transitions. [2022-09-20 20:29:40,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 195 transitions, 1281 flow [2022-09-20 20:29:40,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-09-20 20:29:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-09-20 20:29:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1989 transitions. [2022-09-20 20:29:40,701 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8357142857142857 [2022-09-20 20:29:40,701 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1989 transitions. [2022-09-20 20:29:40,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1989 transitions. [2022-09-20 20:29:40,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:29:40,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1989 transitions. [2022-09-20 20:29:40,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 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-09-20 20:29:40,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 140.0) internal successors, (2520), 18 states have internal predecessors, (2520), 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-09-20 20:29:40,708 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 140.0) internal successors, (2520), 18 states have internal predecessors, (2520), 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-09-20 20:29:40,708 INFO L175 Difference]: Start difference. First operand has 157 places, 126 transitions, 419 flow. Second operand 17 states and 1989 transitions. [2022-09-20 20:29:40,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 195 transitions, 1281 flow [2022-09-20 20:29:40,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 195 transitions, 1046 flow, removed 105 selfloop flow, removed 11 redundant places. [2022-09-20 20:29:40,726 INFO L231 Difference]: Finished difference. Result has 167 places, 140 transitions, 576 flow [2022-09-20 20:29:40,726 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=576, PETRI_PLACES=167, PETRI_TRANSITIONS=140} [2022-09-20 20:29:40,727 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 20 predicate places. [2022-09-20 20:29:40,727 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 140 transitions, 576 flow [2022-09-20 20:29:40,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 113.38461538461539) internal successors, (1474), 13 states have internal predecessors, (1474), 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-09-20 20:29:40,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:29:40,727 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:29:40,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-20 20:29:40,728 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:29:40,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:29:40,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1252361061, now seen corresponding path program 1 times [2022-09-20 20:29:40,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:29:40,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967217533] [2022-09-20 20:29:40,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:29:40,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:29:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:29:40,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:29:40,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:29:40,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967217533] [2022-09-20 20:29:40,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967217533] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:29:40,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:29:40,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 20:29:40,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262737765] [2022-09-20 20:29:40,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:29:40,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 20:29:40,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:29:40,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 20:29:40,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-09-20 20:29:40,841 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 140 [2022-09-20 20:29:40,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 140 transitions, 576 flow. Second operand has 8 states, 8 states have (on average 117.75) internal successors, (942), 8 states have internal predecessors, (942), 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-09-20 20:29:40,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:29:40,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 140 [2022-09-20 20:29:40,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:29:41,483 INFO L130 PetriNetUnfolder]: 1409/3114 cut-off events. [2022-09-20 20:29:41,483 INFO L131 PetriNetUnfolder]: For 22662/23176 co-relation queries the response was YES. [2022-09-20 20:29:41,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14747 conditions, 3114 events. 1409/3114 cut-off events. For 22662/23176 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 22419 event pairs, 443 based on Foata normal form. 64/3069 useless extension candidates. Maximal degree in co-relation 14660. Up to 1130 conditions per place. [2022-09-20 20:29:41,505 INFO L137 encePairwiseOnDemand]: 129/140 looper letters, 51 selfloop transitions, 11 changer transitions 46/208 dead transitions. [2022-09-20 20:29:41,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 208 transitions, 1450 flow [2022-09-20 20:29:41,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 20:29:41,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 20:29:41,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1596 transitions. [2022-09-20 20:29:41,509 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8769230769230769 [2022-09-20 20:29:41,509 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1596 transitions. [2022-09-20 20:29:41,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1596 transitions. [2022-09-20 20:29:41,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:29:41,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1596 transitions. [2022-09-20 20:29:41,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 122.76923076923077) internal successors, (1596), 13 states have internal predecessors, (1596), 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-09-20 20:29:41,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-09-20 20:29:41,514 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-09-20 20:29:41,514 INFO L175 Difference]: Start difference. First operand has 167 places, 140 transitions, 576 flow. Second operand 13 states and 1596 transitions. [2022-09-20 20:29:41,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 208 transitions, 1450 flow [2022-09-20 20:29:41,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 208 transitions, 1280 flow, removed 81 selfloop flow, removed 10 redundant places. [2022-09-20 20:29:41,533 INFO L231 Difference]: Finished difference. Result has 170 places, 145 transitions, 642 flow [2022-09-20 20:29:41,533 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=642, PETRI_PLACES=170, PETRI_TRANSITIONS=145} [2022-09-20 20:29:41,534 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 23 predicate places. [2022-09-20 20:29:41,534 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 145 transitions, 642 flow [2022-09-20 20:29:41,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 117.75) internal successors, (942), 8 states have internal predecessors, (942), 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-09-20 20:29:41,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:29:41,534 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:29:41,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-20 20:29:41,535 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:29:41,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:29:41,535 INFO L85 PathProgramCache]: Analyzing trace with hash 593096651, now seen corresponding path program 2 times [2022-09-20 20:29:41,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:29:41,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682201599] [2022-09-20 20:29:41,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:29:41,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:29:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:29:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:29:41,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:29:41,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682201599] [2022-09-20 20:29:41,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682201599] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:29:41,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:29:41,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-20 20:29:41,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025268325] [2022-09-20 20:29:41,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:29:41,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 20:29:41,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:29:41,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 20:29:41,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-09-20 20:29:41,640 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 140 [2022-09-20 20:29:41,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 145 transitions, 642 flow. Second operand has 10 states, 10 states have (on average 115.6) internal successors, (1156), 10 states have internal predecessors, (1156), 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-09-20 20:29:41,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:29:41,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 140 [2022-09-20 20:29:41,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:29:42,331 INFO L130 PetriNetUnfolder]: 1365/3032 cut-off events. [2022-09-20 20:29:42,332 INFO L131 PetriNetUnfolder]: For 30637/31277 co-relation queries the response was YES. [2022-09-20 20:29:42,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16934 conditions, 3032 events. 1365/3032 cut-off events. For 30637/31277 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 21721 event pairs, 329 based on Foata normal form. 77/3008 useless extension candidates. Maximal degree in co-relation 16843. Up to 1119 conditions per place. [2022-09-20 20:29:42,359 INFO L137 encePairwiseOnDemand]: 128/140 looper letters, 52 selfloop transitions, 16 changer transitions 46/212 dead transitions. [2022-09-20 20:29:42,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 212 transitions, 1742 flow [2022-09-20 20:29:42,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-20 20:29:42,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-09-20 20:29:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1800 transitions. [2022-09-20 20:29:42,363 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2022-09-20 20:29:42,363 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1800 transitions. [2022-09-20 20:29:42,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1800 transitions. [2022-09-20 20:29:42,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:29:42,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1800 transitions. [2022-09-20 20:29:42,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 120.0) internal successors, (1800), 15 states have internal predecessors, (1800), 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-09-20 20:29:42,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 140.0) internal successors, (2240), 16 states have internal predecessors, (2240), 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-09-20 20:29:42,370 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 140.0) internal successors, (2240), 16 states have internal predecessors, (2240), 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-09-20 20:29:42,370 INFO L175 Difference]: Start difference. First operand has 170 places, 145 transitions, 642 flow. Second operand 15 states and 1800 transitions. [2022-09-20 20:29:42,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 212 transitions, 1742 flow [2022-09-20 20:29:42,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 212 transitions, 1653 flow, removed 39 selfloop flow, removed 7 redundant places. [2022-09-20 20:29:42,400 INFO L231 Difference]: Finished difference. Result has 178 places, 149 transitions, 744 flow [2022-09-20 20:29:42,400 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=744, PETRI_PLACES=178, PETRI_TRANSITIONS=149} [2022-09-20 20:29:42,401 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 31 predicate places. [2022-09-20 20:29:42,401 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 149 transitions, 744 flow [2022-09-20 20:29:42,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 115.6) internal successors, (1156), 10 states have internal predecessors, (1156), 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-09-20 20:29:42,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:29:42,401 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:29:42,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-20 20:29:42,402 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:29:42,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:29:42,402 INFO L85 PathProgramCache]: Analyzing trace with hash 892947969, now seen corresponding path program 1 times [2022-09-20 20:29:42,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:29:42,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347357992] [2022-09-20 20:29:42,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:29:42,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:29:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:29:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:29:42,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:29:42,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347357992] [2022-09-20 20:29:42,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347357992] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:29:42,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:29:42,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 20:29:42,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238898446] [2022-09-20 20:29:42,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:29:42,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 20:29:42,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:29:42,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 20:29:42,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-09-20 20:29:42,571 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2022-09-20 20:29:42,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 149 transitions, 744 flow. Second operand has 11 states, 11 states have (on average 114.63636363636364) internal successors, (1261), 11 states have internal predecessors, (1261), 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-09-20 20:29:42,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:29:42,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2022-09-20 20:29:42,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:29:43,422 INFO L130 PetriNetUnfolder]: 1533/3309 cut-off events. [2022-09-20 20:29:43,422 INFO L131 PetriNetUnfolder]: For 62970/63819 co-relation queries the response was YES. [2022-09-20 20:29:43,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23569 conditions, 3309 events. 1533/3309 cut-off events. For 62970/63819 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 23818 event pairs, 209 based on Foata normal form. 99/3305 useless extension candidates. Maximal degree in co-relation 23470. Up to 1225 conditions per place. [2022-09-20 20:29:43,451 INFO L137 encePairwiseOnDemand]: 126/140 looper letters, 56 selfloop transitions, 28 changer transitions 56/237 dead transitions. [2022-09-20 20:29:43,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 237 transitions, 2529 flow [2022-09-20 20:29:43,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-20 20:29:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-09-20 20:29:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2373 transitions. [2022-09-20 20:29:43,455 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8475 [2022-09-20 20:29:43,455 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2373 transitions. [2022-09-20 20:29:43,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2373 transitions. [2022-09-20 20:29:43,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:29:43,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2373 transitions. [2022-09-20 20:29:43,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 118.65) internal successors, (2373), 20 states have internal predecessors, (2373), 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-09-20 20:29:43,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 140.0) internal successors, (2940), 21 states have internal predecessors, (2940), 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-09-20 20:29:43,463 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 140.0) internal successors, (2940), 21 states have internal predecessors, (2940), 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-09-20 20:29:43,463 INFO L175 Difference]: Start difference. First operand has 178 places, 149 transitions, 744 flow. Second operand 20 states and 2373 transitions. [2022-09-20 20:29:43,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 237 transitions, 2529 flow [2022-09-20 20:29:43,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 237 transitions, 2119 flow, removed 197 selfloop flow, removed 12 redundant places. [2022-09-20 20:29:43,498 INFO L231 Difference]: Finished difference. Result has 190 places, 156 transitions, 936 flow [2022-09-20 20:29:43,499 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=936, PETRI_PLACES=190, PETRI_TRANSITIONS=156} [2022-09-20 20:29:43,499 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 43 predicate places. [2022-09-20 20:29:43,499 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 156 transitions, 936 flow [2022-09-20 20:29:43,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 114.63636363636364) internal successors, (1261), 11 states have internal predecessors, (1261), 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-09-20 20:29:43,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:29:43,500 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:29:43,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-20 20:29:43,500 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:29:43,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:29:43,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1172407886, now seen corresponding path program 1 times [2022-09-20 20:29:43,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:29:43,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150151118] [2022-09-20 20:29:43,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:29:43,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:29:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:29:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:29:43,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:29:43,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150151118] [2022-09-20 20:29:43,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150151118] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:29:43,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:29:43,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:29:43,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624144244] [2022-09-20 20:29:43,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:29:43,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:29:43,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:29:43,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:29:43,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:29:43,564 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 140 [2022-09-20 20:29:43,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 156 transitions, 936 flow. Second operand has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 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-09-20 20:29:43,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:29:43,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 140 [2022-09-20 20:29:43,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:29:44,566 INFO L130 PetriNetUnfolder]: 2848/6298 cut-off events. [2022-09-20 20:29:44,566 INFO L131 PetriNetUnfolder]: For 159720/163705 co-relation queries the response was YES. [2022-09-20 20:29:44,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46512 conditions, 6298 events. 2848/6298 cut-off events. For 159720/163705 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 53723 event pairs, 389 based on Foata normal form. 182/6231 useless extension candidates. Maximal degree in co-relation 46409. Up to 2269 conditions per place. [2022-09-20 20:29:44,737 INFO L137 encePairwiseOnDemand]: 134/140 looper letters, 87 selfloop transitions, 2 changer transitions 40/235 dead transitions. [2022-09-20 20:29:44,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 235 transitions, 2512 flow [2022-09-20 20:29:44,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 20:29:44,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 20:29:44,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2022-09-20 20:29:44,739 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8714285714285714 [2022-09-20 20:29:44,739 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2022-09-20 20:29:44,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2022-09-20 20:29:44,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:29:44,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2022-09-20 20:29:44,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-09-20 20:29:44,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 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-09-20 20:29:44,742 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 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-09-20 20:29:44,742 INFO L175 Difference]: Start difference. First operand has 190 places, 156 transitions, 936 flow. Second operand 7 states and 854 transitions. [2022-09-20 20:29:44,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 235 transitions, 2512 flow [2022-09-20 20:29:44,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 235 transitions, 2239 flow, removed 134 selfloop flow, removed 12 redundant places. [2022-09-20 20:29:44,882 INFO L231 Difference]: Finished difference. Result has 177 places, 156 transitions, 859 flow [2022-09-20 20:29:44,882 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=859, PETRI_PLACES=177, PETRI_TRANSITIONS=156} [2022-09-20 20:29:44,883 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 30 predicate places. [2022-09-20 20:29:44,883 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 156 transitions, 859 flow [2022-09-20 20:29:44,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 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-09-20 20:29:44,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:29:44,883 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:29:44,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-20 20:29:44,884 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:29:44,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:29:44,884 INFO L85 PathProgramCache]: Analyzing trace with hash -967350092, now seen corresponding path program 2 times [2022-09-20 20:29:44,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:29:44,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367562705] [2022-09-20 20:29:44,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:29:44,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:29:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:29:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:29:44,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:29:44,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367562705] [2022-09-20 20:29:44,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367562705] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:29:44,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:29:44,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:29:44,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060224345] [2022-09-20 20:29:44,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:29:44,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:29:44,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:29:44,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:29:44,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:29:44,966 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2022-09-20 20:29:44,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 156 transitions, 859 flow. Second operand has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 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-09-20 20:29:44,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:29:44,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2022-09-20 20:29:44,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:29:49,457 INFO L130 PetriNetUnfolder]: 19769/32346 cut-off events. [2022-09-20 20:29:49,457 INFO L131 PetriNetUnfolder]: For 754833/772312 co-relation queries the response was YES. [2022-09-20 20:29:49,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191218 conditions, 32346 events. 19769/32346 cut-off events. For 754833/772312 co-relation queries the response was YES. Maximal size of possible extension queue 2268. Compared 277988 event pairs, 870 based on Foata normal form. 1803/32300 useless extension candidates. Maximal degree in co-relation 191122. Up to 11991 conditions per place. [2022-09-20 20:29:49,770 INFO L137 encePairwiseOnDemand]: 129/140 looper letters, 112 selfloop transitions, 14 changer transitions 119/349 dead transitions. [2022-09-20 20:29:49,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 349 transitions, 3530 flow [2022-09-20 20:29:49,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 20:29:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 20:29:49,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1230 transitions. [2022-09-20 20:29:49,772 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8785714285714286 [2022-09-20 20:29:49,772 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1230 transitions. [2022-09-20 20:29:49,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1230 transitions. [2022-09-20 20:29:49,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:29:49,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1230 transitions. [2022-09-20 20:29:49,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.0) internal successors, (1230), 10 states have internal predecessors, (1230), 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-09-20 20:29:49,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 140.0) internal successors, (1540), 11 states have internal predecessors, (1540), 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-09-20 20:29:49,778 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 140.0) internal successors, (1540), 11 states have internal predecessors, (1540), 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-09-20 20:29:49,778 INFO L175 Difference]: Start difference. First operand has 177 places, 156 transitions, 859 flow. Second operand 10 states and 1230 transitions. [2022-09-20 20:29:49,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 349 transitions, 3530 flow [2022-09-20 20:29:49,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 349 transitions, 3523 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-09-20 20:29:49,918 INFO L231 Difference]: Finished difference. Result has 185 places, 166 transitions, 943 flow [2022-09-20 20:29:49,919 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=943, PETRI_PLACES=185, PETRI_TRANSITIONS=166} [2022-09-20 20:29:49,920 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 38 predicate places. [2022-09-20 20:29:49,920 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 166 transitions, 943 flow [2022-09-20 20:29:49,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 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-09-20 20:29:49,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:29:49,920 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:29:49,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-09-20 20:29:49,920 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:29:49,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:29:49,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1428658081, now seen corresponding path program 1 times [2022-09-20 20:29:49,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:29:49,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181486431] [2022-09-20 20:29:49,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:29:49,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:29:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:29:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:29:49,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:29:49,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181486431] [2022-09-20 20:29:49,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181486431] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:29:49,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:29:49,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:29:49,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120929467] [2022-09-20 20:29:49,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:29:49,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:29:49,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:29:49,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:29:49,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:29:49,993 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2022-09-20 20:29:49,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 166 transitions, 943 flow. Second operand has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 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-09-20 20:29:49,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:29:49,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2022-09-20 20:29:49,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:29:54,457 INFO L130 PetriNetUnfolder]: 17454/30460 cut-off events. [2022-09-20 20:29:54,457 INFO L131 PetriNetUnfolder]: For 723606/741464 co-relation queries the response was YES. [2022-09-20 20:29:54,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193782 conditions, 30460 events. 17454/30460 cut-off events. For 723606/741464 co-relation queries the response was YES. Maximal size of possible extension queue 2441. Compared 289974 event pairs, 323 based on Foata normal form. 2329/31733 useless extension candidates. Maximal degree in co-relation 193681. Up to 9382 conditions per place. [2022-09-20 20:29:54,704 INFO L137 encePairwiseOnDemand]: 129/140 looper letters, 125 selfloop transitions, 26 changer transitions 149/404 dead transitions. [2022-09-20 20:29:54,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 404 transitions, 4604 flow [2022-09-20 20:29:54,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 20:29:54,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 20:29:54,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1597 transitions. [2022-09-20 20:29:54,707 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8774725274725275 [2022-09-20 20:29:54,707 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1597 transitions. [2022-09-20 20:29:54,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1597 transitions. [2022-09-20 20:29:54,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:29:54,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1597 transitions. [2022-09-20 20:29:54,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 122.84615384615384) internal successors, (1597), 13 states have internal predecessors, (1597), 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-09-20 20:29:54,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-09-20 20:29:54,712 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-09-20 20:29:54,712 INFO L175 Difference]: Start difference. First operand has 185 places, 166 transitions, 943 flow. Second operand 13 states and 1597 transitions. [2022-09-20 20:29:54,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 404 transitions, 4604 flow [2022-09-20 20:29:55,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 404 transitions, 4602 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-20 20:29:55,024 INFO L231 Difference]: Finished difference. Result has 202 places, 179 transitions, 1139 flow [2022-09-20 20:29:55,024 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1139, PETRI_PLACES=202, PETRI_TRANSITIONS=179} [2022-09-20 20:29:55,025 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 55 predicate places. [2022-09-20 20:29:55,025 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 179 transitions, 1139 flow [2022-09-20 20:29:55,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 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-09-20 20:29:55,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:29:55,025 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:29:55,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-09-20 20:29:55,025 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:29:55,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:29:55,025 INFO L85 PathProgramCache]: Analyzing trace with hash 595778718, now seen corresponding path program 1 times [2022-09-20 20:29:55,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:29:55,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028362943] [2022-09-20 20:29:55,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:29:55,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:29:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:29:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:29:55,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:29:55,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028362943] [2022-09-20 20:29:55,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028362943] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:29:55,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:29:55,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 20:29:55,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810057321] [2022-09-20 20:29:55,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:29:55,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 20:29:55,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:29:55,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 20:29:55,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-09-20 20:29:55,145 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2022-09-20 20:29:55,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 179 transitions, 1139 flow. Second operand has 9 states, 9 states have (on average 116.88888888888889) internal successors, (1052), 9 states have internal predecessors, (1052), 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-09-20 20:29:55,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:29:55,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2022-09-20 20:29:55,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:29:56,616 INFO L130 PetriNetUnfolder]: 2509/9734 cut-off events. [2022-09-20 20:29:56,617 INFO L131 PetriNetUnfolder]: For 78878/88894 co-relation queries the response was YES. [2022-09-20 20:29:56,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43621 conditions, 9734 events. 2509/9734 cut-off events. For 78878/88894 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 125747 event pairs, 375 based on Foata normal form. 101/9194 useless extension candidates. Maximal degree in co-relation 43510. Up to 2360 conditions per place. [2022-09-20 20:29:56,926 INFO L137 encePairwiseOnDemand]: 128/140 looper letters, 76 selfloop transitions, 22 changer transitions 0/226 dead transitions. [2022-09-20 20:29:56,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 226 transitions, 2189 flow [2022-09-20 20:29:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 20:29:56,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 20:29:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1455 transitions. [2022-09-20 20:29:56,928 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8660714285714286 [2022-09-20 20:29:56,928 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1455 transitions. [2022-09-20 20:29:56,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1455 transitions. [2022-09-20 20:29:56,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:29:56,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1455 transitions. [2022-09-20 20:29:56,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 121.25) internal successors, (1455), 12 states have internal predecessors, (1455), 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-09-20 20:29:56,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 140.0) internal successors, (1820), 13 states have internal predecessors, (1820), 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-09-20 20:29:56,932 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 140.0) internal successors, (1820), 13 states have internal predecessors, (1820), 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-09-20 20:29:56,932 INFO L175 Difference]: Start difference. First operand has 202 places, 179 transitions, 1139 flow. Second operand 12 states and 1455 transitions. [2022-09-20 20:29:56,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 226 transitions, 2189 flow [2022-09-20 20:29:57,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 226 transitions, 2116 flow, removed 30 selfloop flow, removed 4 redundant places. [2022-09-20 20:29:57,338 INFO L231 Difference]: Finished difference. Result has 212 places, 187 transitions, 1240 flow [2022-09-20 20:29:57,338 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1240, PETRI_PLACES=212, PETRI_TRANSITIONS=187} [2022-09-20 20:29:57,339 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 65 predicate places. [2022-09-20 20:29:57,339 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 187 transitions, 1240 flow [2022-09-20 20:29:57,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.88888888888889) internal successors, (1052), 9 states have internal predecessors, (1052), 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-09-20 20:29:57,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:29:57,339 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:29:57,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-09-20 20:29:57,339 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:29:57,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:29:57,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1098956961, now seen corresponding path program 1 times [2022-09-20 20:29:57,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:29:57,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860021295] [2022-09-20 20:29:57,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:29:57,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:29:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:29:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:29:57,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:29:57,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860021295] [2022-09-20 20:29:57,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860021295] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:29:57,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:29:57,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 20:29:57,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930213815] [2022-09-20 20:29:57,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:29:57,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 20:29:57,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:29:57,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 20:29:57,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 20:29:57,432 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2022-09-20 20:29:57,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 187 transitions, 1240 flow. Second operand has 8 states, 8 states have (on average 115.25) internal successors, (922), 8 states have internal predecessors, (922), 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-09-20 20:29:57,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:29:57,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2022-09-20 20:29:57,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:30:02,029 INFO L130 PetriNetUnfolder]: 14338/27598 cut-off events. [2022-09-20 20:30:02,029 INFO L131 PetriNetUnfolder]: For 684810/702105 co-relation queries the response was YES. [2022-09-20 20:30:02,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179798 conditions, 27598 events. 14338/27598 cut-off events. For 684810/702105 co-relation queries the response was YES. Maximal size of possible extension queue 2387. Compared 290704 event pairs, 310 based on Foata normal form. 1507/28138 useless extension candidates. Maximal degree in co-relation 179685. Up to 8700 conditions per place. [2022-09-20 20:30:02,345 INFO L137 encePairwiseOnDemand]: 129/140 looper letters, 121 selfloop transitions, 31 changer transitions 180/436 dead transitions. [2022-09-20 20:30:02,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 436 transitions, 5491 flow [2022-09-20 20:30:02,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 20:30:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 20:30:02,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1963 transitions. [2022-09-20 20:30:02,348 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8763392857142858 [2022-09-20 20:30:02,348 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1963 transitions. [2022-09-20 20:30:02,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1963 transitions. [2022-09-20 20:30:02,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:30:02,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1963 transitions. [2022-09-20 20:30:02,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 122.6875) internal successors, (1963), 16 states have internal predecessors, (1963), 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-09-20 20:30:02,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 140.0) internal successors, (2380), 17 states have internal predecessors, (2380), 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-09-20 20:30:02,352 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 140.0) internal successors, (2380), 17 states have internal predecessors, (2380), 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-09-20 20:30:02,352 INFO L175 Difference]: Start difference. First operand has 212 places, 187 transitions, 1240 flow. Second operand 16 states and 1963 transitions. [2022-09-20 20:30:02,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 436 transitions, 5491 flow [2022-09-20 20:30:03,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 436 transitions, 4987 flow, removed 130 selfloop flow, removed 10 redundant places. [2022-09-20 20:30:03,408 INFO L231 Difference]: Finished difference. Result has 224 places, 182 transitions, 1202 flow [2022-09-20 20:30:03,408 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1202, PETRI_PLACES=224, PETRI_TRANSITIONS=182} [2022-09-20 20:30:03,409 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 77 predicate places. [2022-09-20 20:30:03,409 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 182 transitions, 1202 flow [2022-09-20 20:30:03,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.25) internal successors, (922), 8 states have internal predecessors, (922), 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-09-20 20:30:03,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:30:03,409 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:30:03,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-09-20 20:30:03,409 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:30:03,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:30:03,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1819527899, now seen corresponding path program 1 times [2022-09-20 20:30:03,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:30:03,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715137754] [2022-09-20 20:30:03,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:30:03,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:30:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:30:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:30:03,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:30:03,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715137754] [2022-09-20 20:30:03,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715137754] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:30:03,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:30:03,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 20:30:03,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064058118] [2022-09-20 20:30:03,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:30:03,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 20:30:03,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:30:03,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 20:30:03,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-09-20 20:30:03,509 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2022-09-20 20:30:03,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 182 transitions, 1202 flow. Second operand has 9 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 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-09-20 20:30:03,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:30:03,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2022-09-20 20:30:03,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:30:07,749 INFO L130 PetriNetUnfolder]: 12869/24644 cut-off events. [2022-09-20 20:30:07,749 INFO L131 PetriNetUnfolder]: For 573694/589800 co-relation queries the response was YES. [2022-09-20 20:30:07,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163027 conditions, 24644 events. 12869/24644 cut-off events. For 573694/589800 co-relation queries the response was YES. Maximal size of possible extension queue 2388. Compared 260407 event pairs, 191 based on Foata normal form. 1340/24991 useless extension candidates. Maximal degree in co-relation 162972. Up to 8327 conditions per place. [2022-09-20 20:30:07,975 INFO L137 encePairwiseOnDemand]: 130/140 looper letters, 62 selfloop transitions, 19 changer transitions 212/394 dead transitions. [2022-09-20 20:30:07,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 394 transitions, 4546 flow [2022-09-20 20:30:07,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-20 20:30:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-09-20 20:30:07,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2167 transitions. [2022-09-20 20:30:07,981 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.859920634920635 [2022-09-20 20:30:07,981 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2167 transitions. [2022-09-20 20:30:07,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2167 transitions. [2022-09-20 20:30:07,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:30:07,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2167 transitions. [2022-09-20 20:30:07,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 120.38888888888889) internal successors, (2167), 18 states have internal predecessors, (2167), 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-09-20 20:30:07,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 140.0) internal successors, (2660), 19 states have internal predecessors, (2660), 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-09-20 20:30:07,986 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 140.0) internal successors, (2660), 19 states have internal predecessors, (2660), 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-09-20 20:30:07,986 INFO L175 Difference]: Start difference. First operand has 224 places, 182 transitions, 1202 flow. Second operand 18 states and 2167 transitions. [2022-09-20 20:30:07,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 394 transitions, 4546 flow [2022-09-20 20:30:09,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 394 transitions, 3824 flow, removed 288 selfloop flow, removed 18 redundant places. [2022-09-20 20:30:09,913 INFO L231 Difference]: Finished difference. Result has 220 places, 150 transitions, 782 flow [2022-09-20 20:30:09,913 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1003, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=782, PETRI_PLACES=220, PETRI_TRANSITIONS=150} [2022-09-20 20:30:09,913 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 73 predicate places. [2022-09-20 20:30:09,913 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 150 transitions, 782 flow [2022-09-20 20:30:09,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 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-09-20 20:30:09,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:30:09,914 INFO L208 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, 1, 1, 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-09-20 20:30:09,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-09-20 20:30:09,914 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:30:09,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:30:09,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1906213868, now seen corresponding path program 1 times [2022-09-20 20:30:09,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:30:09,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900793528] [2022-09-20 20:30:09,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:30:09,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:30:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:30:10,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:30:10,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:30:10,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900793528] [2022-09-20 20:30:10,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900793528] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:30:10,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:30:10,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:30:10,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136548] [2022-09-20 20:30:10,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:30:10,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:30:10,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:30:10,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:30:10,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:30:10,004 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2022-09-20 20:30:10,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 150 transitions, 782 flow. Second operand has 7 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 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-09-20 20:30:10,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:30:10,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2022-09-20 20:30:10,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:30:10,643 INFO L130 PetriNetUnfolder]: 1328/4818 cut-off events. [2022-09-20 20:30:10,643 INFO L131 PetriNetUnfolder]: For 34343/36411 co-relation queries the response was YES. [2022-09-20 20:30:10,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18573 conditions, 4818 events. 1328/4818 cut-off events. For 34343/36411 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 53785 event pairs, 38 based on Foata normal form. 51/4380 useless extension candidates. Maximal degree in co-relation 18461. Up to 1064 conditions per place. [2022-09-20 20:30:10,681 INFO L137 encePairwiseOnDemand]: 134/140 looper letters, 40 selfloop transitions, 1 changer transitions 34/189 dead transitions. [2022-09-20 20:30:10,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 189 transitions, 1296 flow [2022-09-20 20:30:10,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 20:30:10,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 20:30:10,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 844 transitions. [2022-09-20 20:30:10,683 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8612244897959184 [2022-09-20 20:30:10,683 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 844 transitions. [2022-09-20 20:30:10,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 844 transitions. [2022-09-20 20:30:10,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:30:10,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 844 transitions. [2022-09-20 20:30:10,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.57142857142857) internal successors, (844), 7 states have internal predecessors, (844), 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-09-20 20:30:10,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 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-09-20 20:30:10,685 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 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-09-20 20:30:10,685 INFO L175 Difference]: Start difference. First operand has 220 places, 150 transitions, 782 flow. Second operand 7 states and 844 transitions. [2022-09-20 20:30:10,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 189 transitions, 1296 flow [2022-09-20 20:30:10,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 189 transitions, 932 flow, removed 131 selfloop flow, removed 41 redundant places. [2022-09-20 20:30:10,886 INFO L231 Difference]: Finished difference. Result has 167 places, 145 transitions, 508 flow [2022-09-20 20:30:10,886 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=508, PETRI_PLACES=167, PETRI_TRANSITIONS=145} [2022-09-20 20:30:10,886 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 20 predicate places. [2022-09-20 20:30:10,886 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 145 transitions, 508 flow [2022-09-20 20:30:10,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 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-09-20 20:30:10,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:30:10,887 INFO L208 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, 1, 1, 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-09-20 20:30:10,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-09-20 20:30:10,887 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:30:10,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:30:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1952033100, now seen corresponding path program 2 times [2022-09-20 20:30:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:30:10,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230075698] [2022-09-20 20:30:10,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:30:10,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:30:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:30:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:30:11,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:30:11,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230075698] [2022-09-20 20:30:11,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230075698] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:30:11,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:30:11,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-09-20 20:30:11,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539636583] [2022-09-20 20:30:11,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:30:11,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-09-20 20:30:11,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:30:11,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-09-20 20:30:11,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-09-20 20:30:11,199 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 140 [2022-09-20 20:30:11,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 145 transitions, 508 flow. Second operand has 17 states, 17 states have (on average 108.6470588235294) internal successors, (1847), 17 states have internal predecessors, (1847), 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-09-20 20:30:11,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:30:11,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 140 [2022-09-20 20:30:11,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:30:11,759 INFO L130 PetriNetUnfolder]: 706/3010 cut-off events. [2022-09-20 20:30:11,759 INFO L131 PetriNetUnfolder]: For 1630/1957 co-relation queries the response was YES. [2022-09-20 20:30:11,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5833 conditions, 3010 events. 706/3010 cut-off events. For 1630/1957 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 31265 event pairs, 20 based on Foata normal form. 61/2813 useless extension candidates. Maximal degree in co-relation 5808. Up to 564 conditions per place. [2022-09-20 20:30:11,778 INFO L137 encePairwiseOnDemand]: 126/140 looper letters, 36 selfloop transitions, 8 changer transitions 29/176 dead transitions. [2022-09-20 20:30:11,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 176 transitions, 850 flow [2022-09-20 20:30:11,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-09-20 20:30:11,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-09-20 20:30:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1878 transitions. [2022-09-20 20:30:11,780 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7890756302521008 [2022-09-20 20:30:11,780 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1878 transitions. [2022-09-20 20:30:11,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1878 transitions. [2022-09-20 20:30:11,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:30:11,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1878 transitions. [2022-09-20 20:30:11,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 110.47058823529412) internal successors, (1878), 17 states have internal predecessors, (1878), 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-09-20 20:30:11,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 140.0) internal successors, (2520), 18 states have internal predecessors, (2520), 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-09-20 20:30:11,785 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 140.0) internal successors, (2520), 18 states have internal predecessors, (2520), 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-09-20 20:30:11,785 INFO L175 Difference]: Start difference. First operand has 167 places, 145 transitions, 508 flow. Second operand 17 states and 1878 transitions. [2022-09-20 20:30:11,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 176 transitions, 850 flow [2022-09-20 20:30:11,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 176 transitions, 779 flow, removed 34 selfloop flow, removed 9 redundant places. [2022-09-20 20:30:11,790 INFO L231 Difference]: Finished difference. Result has 176 places, 142 transitions, 503 flow [2022-09-20 20:30:11,790 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=503, PETRI_PLACES=176, PETRI_TRANSITIONS=142} [2022-09-20 20:30:11,791 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 29 predicate places. [2022-09-20 20:30:11,791 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 142 transitions, 503 flow [2022-09-20 20:30:11,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 108.6470588235294) internal successors, (1847), 17 states have internal predecessors, (1847), 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-09-20 20:30:11,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:30:11,791 INFO L208 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, 1, 1, 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-09-20 20:30:11,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-09-20 20:30:11,792 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:30:11,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:30:11,792 INFO L85 PathProgramCache]: Analyzing trace with hash -463907094, now seen corresponding path program 3 times [2022-09-20 20:30:11,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:30:11,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584935871] [2022-09-20 20:30:11,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:30:11,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:30:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 20:30:11,830 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-20 20:30:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 20:30:11,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-20 20:30:11,914 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-09-20 20:30:11,915 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-09-20 20:30:11,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-09-20 20:30:11,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-09-20 20:30:11,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-09-20 20:30:11,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-09-20 20:30:11,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-09-20 20:30:11,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-09-20 20:30:11,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-09-20 20:30:11,920 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:30:11,925 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 20:30:11,925 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 20:30:12,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 08:30:12 BasicIcfg [2022-09-20 20:30:12,064 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 20:30:12,066 INFO L158 Benchmark]: Toolchain (without parser) took 38226.53ms. Allocated memory was 168.8MB in the beginning and 5.6GB in the end (delta: 5.5GB). Free memory was 138.2MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-09-20 20:30:12,066 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 168.8MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 20:30:12,066 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.99ms. Allocated memory is still 212.9MB. Free memory was 187.0MB in the beginning and 168.9MB in the end (delta: 18.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-09-20 20:30:12,067 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.83ms. Allocated memory is still 212.9MB. Free memory was 168.4MB in the beginning and 165.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 20:30:12,067 INFO L158 Benchmark]: Boogie Preprocessor took 34.62ms. Allocated memory is still 212.9MB. Free memory was 165.7MB in the beginning and 163.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-20 20:30:12,067 INFO L158 Benchmark]: RCFGBuilder took 872.11ms. Allocated memory is still 212.9MB. Free memory was 163.1MB in the beginning and 132.1MB in the end (delta: 31.0MB). Peak memory consumption was 45.2MB. Max. memory is 8.0GB. [2022-09-20 20:30:12,067 INFO L158 Benchmark]: TraceAbstraction took 36842.38ms. Allocated memory was 212.9MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 131.6MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-09-20 20:30:12,068 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 168.8MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 410.99ms. Allocated memory is still 212.9MB. Free memory was 187.0MB in the beginning and 168.9MB in the end (delta: 18.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.83ms. Allocated memory is still 212.9MB. Free memory was 168.4MB in the beginning and 165.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.62ms. Allocated memory is still 212.9MB. Free memory was 165.7MB in the beginning and 163.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 872.11ms. Allocated memory is still 212.9MB. Free memory was 163.1MB in the beginning and 132.1MB in the end (delta: 31.0MB). Peak memory consumption was 45.2MB. Max. memory is 8.0GB. * TraceAbstraction took 36842.38ms. Allocated memory was 212.9MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 131.6MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 2.2GB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0] [L720] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L722] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L727] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L728] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L729] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L730] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L731] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L732] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L733] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0] [L734] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0] [L735] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L736] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L737] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L738] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L739] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L740] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L741] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L742] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L743] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L744] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L746] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L748] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L858] 0 pthread_t t145; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t145={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t145, ((void *)0), P0, ((void *)0))=-3, t145={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L860] 0 pthread_t t146; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t145={5:0}, t146={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t146, ((void *)0), P1, ((void *)0))=-2, t145={5:0}, t146={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L862] 0 pthread_t t147; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t147, ((void *)0), P2, ((void *)0))=-1, t145={5:0}, t146={6:0}, t147={7: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L864] 0 pthread_t t148; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t148, ((void *)0), P3, ((void *)0))=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$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 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 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 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] 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) [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L762] 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 [L763] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L764] 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 [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] 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) [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 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 [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L817] 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 [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 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) [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 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 [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L875] 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 [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] EXPR 0 !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) [L882] 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) [L883] EXPR 0 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)) [L883] EXPR 0 !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) [L883] EXPR 0 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)) [L883] 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)) [L884] EXPR 0 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)) [L884] EXPR 0 !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) [L884] EXPR 0 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)) [L884] 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)) [L885] EXPR 0 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)) [L885] EXPR 0 !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) [L885] EXPR 0 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)) [L885] 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)) [L886] EXPR 0 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)) [L886] EXPR 0 !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) [L886] EXPR 0 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)) [L886] 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)) [L887] EXPR 0 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)) [L887] EXPR 0 !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) [L887] EXPR 0 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)) [L887] 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)) [L888] EXPR 0 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)) [L888] EXPR 0 !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) [L888] EXPR 0 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)) [L888] 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)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=49, weak$$choice2=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 859]: 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: 865]: 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: 861]: 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 9 procedures, 178 locations, 7 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: 36.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 33.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1228 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1228 mSDsluCounter, 797 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1776 mSDsCounter, 415 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3089 IncrementalHoareTripleChecker+Invalid, 3504 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 415 mSolverCounterUnsat, 151 mSDtfsCounter, 3089 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1240occurred in iteration=14, InterpolantAutomatonStates: 217, 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.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1827 NumberOfCodeBlocks, 1827 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1700 ConstructedInterpolants, 0 QuantifiedInterpolants, 9627 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-09-20 20:30:12,109 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...