/usr/bin/java -Xmx16000000000 -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-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 04:55:52,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 04:55:52,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 04:55:52,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 04:55:52,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 04:55:52,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 04:55:52,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 04:55:52,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 04:55:52,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 04:55:52,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 04:55:52,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 04:55:52,084 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 04:55:52,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 04:55:52,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 04:55:52,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 04:55:52,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 04:55:52,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 04:55:52,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 04:55:52,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 04:55:52,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 04:55:52,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 04:55:52,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 04:55:52,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 04:55:52,103 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 04:55:52,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 04:55:52,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 04:55:52,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 04:55:52,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 04:55:52,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 04:55:52,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 04:55:52,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 04:55:52,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 04:55:52,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 04:55:52,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 04:55:52,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 04:55:52,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 04:55:52,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 04:55:52,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 04:55:52,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 04:55:52,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 04:55:52,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 04:55:52,111 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-Before.epf [2022-01-19 04:55:52,124 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 04:55:52,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 04:55:52,124 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 04:55:52,125 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 04:55:52,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 04:55:52,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 04:55:52,125 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 04:55:52,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 04:55:52,125 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 04:55:52,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 04:55:52,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 04:55:52,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 04:55:52,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 04:55:52,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 04:55:52,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 04:55:52,126 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 04:55:52,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 04:55:52,126 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 04:55:52,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 04:55:52,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 04:55:52,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 04:55:52,127 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 04:55:52,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 04:55:52,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:55:52,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 04:55:52,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 04:55:52,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 04:55:52,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 04:55:52,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 04:55:52,128 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 04:55:52,128 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 04:55:52,128 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 04:55:52,128 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-01-19 04:55:52,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 04:55:52,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 04:55:52,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 04:55:52,271 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 04:55:52,271 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 04:55:52,272 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-01-19 04:55:52,311 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44315a56b/94be3ebf57c9456cb2e1b01bbe0a3a35/FLAG6e89146f0 [2022-01-19 04:55:52,742 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 04:55:52,743 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-01-19 04:55:52,761 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44315a56b/94be3ebf57c9456cb2e1b01bbe0a3a35/FLAG6e89146f0 [2022-01-19 04:55:52,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44315a56b/94be3ebf57c9456cb2e1b01bbe0a3a35 [2022-01-19 04:55:52,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 04:55:52,776 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 04:55:52,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 04:55:52,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 04:55:52,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 04:55:52,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:55:52" (1/1) ... [2022-01-19 04:55:52,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b960dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:55:52, skipping insertion in model container [2022-01-19 04:55:52,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:55:52" (1/1) ... [2022-01-19 04:55:52,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 04:55:52,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 04:55:52,989 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-01-19 04:55:53,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:55:53,138 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 04:55:53,145 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-01-19 04:55:53,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:55:53,191 INFO L208 MainTranslator]: Completed translation [2022-01-19 04:55:53,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:55:53 WrapperNode [2022-01-19 04:55:53,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 04:55:53,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 04:55:53,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 04:55:53,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 04:55:53,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:55:53" (1/1) ... [2022-01-19 04:55:53,205 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:55:53" (1/1) ... [2022-01-19 04:55:53,225 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2022-01-19 04:55:53,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 04:55:53,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 04:55:53,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 04:55:53,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 04:55:53,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:55:53" (1/1) ... [2022-01-19 04:55:53,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:55:53" (1/1) ... [2022-01-19 04:55:53,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:55:53" (1/1) ... [2022-01-19 04:55:53,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:55:53" (1/1) ... [2022-01-19 04:55:53,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:55:53" (1/1) ... [2022-01-19 04:55:53,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:55:53" (1/1) ... [2022-01-19 04:55:53,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:55:53" (1/1) ... [2022-01-19 04:55:53,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 04:55:53,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 04:55:53,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 04:55:53,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 04:55:53,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:55:53" (1/1) ... [2022-01-19 04:55:53,252 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:55:53,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:55:53,288 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-01-19 04:55:53,307 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-01-19 04:55:53,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 04:55:53,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 04:55:53,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 04:55:53,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 04:55:53,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 04:55:53,311 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 04:55:53,312 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 04:55:53,312 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 04:55:53,312 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 04:55:53,312 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-19 04:55:53,312 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-19 04:55:53,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 04:55:53,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 04:55:53,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 04:55:53,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 04:55:53,313 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 04:55:53,424 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 04:55:53,425 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 04:55:53,748 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 04:55:53,983 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 04:55:53,983 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 04:55:53,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:55:53 BoogieIcfgContainer [2022-01-19 04:55:53,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 04:55:53,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 04:55:53,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 04:55:53,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 04:55:53,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 04:55:52" (1/3) ... [2022-01-19 04:55:53,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3675a60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:55:53, skipping insertion in model container [2022-01-19 04:55:53,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:55:53" (2/3) ... [2022-01-19 04:55:53,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3675a60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:55:53, skipping insertion in model container [2022-01-19 04:55:53,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:55:53" (3/3) ... [2022-01-19 04:55:53,992 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-01-19 04:55:53,996 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 04:55:53,996 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 04:55:53,996 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 04:55:54,033 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,033 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,033 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,034 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,034 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,034 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,034 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,034 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,034 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,034 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,034 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,034 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,035 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,035 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,035 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,036 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,036 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,036 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,038 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,038 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,038 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,038 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,038 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,038 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,038 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,039 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,039 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,039 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,039 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,039 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,039 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,041 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,041 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,041 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,041 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,041 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,044 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,044 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,044 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,044 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,046 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,046 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,046 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,046 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,046 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,046 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,047 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,047 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,047 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,047 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,048 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,048 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,049 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,049 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,049 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,050 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,050 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,050 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,051 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,052 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,056 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,056 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,056 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,056 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:55:54,057 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 04:55:54,088 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:55:54,093 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 04:55:54,093 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-19 04:55:54,099 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-01-19 04:55:54,130 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2022-01-19 04:55:54,131 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:55:54,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-01-19 04:55:54,133 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-01-19 04:55:54,136 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-01-19 04:55:54,145 INFO L129 PetriNetUnfolder]: 0/72 cut-off events. [2022-01-19 04:55:54,146 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:55:54,146 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:55:54,146 INFO L254 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-01-19 04:55:54,146 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:55:54,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:55:54,150 INFO L85 PathProgramCache]: Analyzing trace with hash -146856561, now seen corresponding path program 1 times [2022-01-19 04:55:54,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:55:54,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628212949] [2022-01-19 04:55:54,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:55:54,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:55:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:55:54,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:55:54,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:55:54,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628212949] [2022-01-19 04:55:54,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628212949] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:55:54,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:55:54,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 04:55:54,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145097422] [2022-01-19 04:55:54,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:55:54,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 04:55:54,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:55:54,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 04:55:54,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 04:55:54,417 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 113 [2022-01-19 04:55:54,422 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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-01-19 04:55:54,422 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:55:54,422 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 113 [2022-01-19 04:55:54,423 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:55:54,525 INFO L129 PetriNetUnfolder]: 17/242 cut-off events. [2022-01-19 04:55:54,526 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 04:55:54,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 242 events. 17/242 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 748 event pairs, 7 based on Foata normal form. 8/238 useless extension candidates. Maximal degree in co-relation 243. Up to 27 conditions per place. [2022-01-19 04:55:54,530 INFO L132 encePairwiseOnDemand]: 108/113 looper letters, 10 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2022-01-19 04:55:54,530 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 109 transitions, 251 flow [2022-01-19 04:55:54,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 04:55:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 04:55:54,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2022-01-19 04:55:54,545 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9351032448377581 [2022-01-19 04:55:54,545 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2022-01-19 04:55:54,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2022-01-19 04:55:54,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:55:54,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2022-01-19 04:55:54,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-01-19 04:55:54,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-01-19 04:55:54,560 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-01-19 04:55:54,561 INFO L186 Difference]: Start difference. First operand has 118 places, 110 transitions, 229 flow. Second operand 3 states and 317 transitions. [2022-01-19 04:55:54,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 109 transitions, 251 flow [2022-01-19 04:55:54,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 109 transitions, 248 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 04:55:54,567 INFO L242 Difference]: Finished difference. Result has 115 places, 106 transitions, 222 flow [2022-01-19 04:55:54,568 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=115, PETRI_TRANSITIONS=106} [2022-01-19 04:55:54,570 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2022-01-19 04:55:54,570 INFO L470 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 222 flow [2022-01-19 04:55:54,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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-01-19 04:55:54,571 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:55:54,571 INFO L254 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] [2022-01-19 04:55:54,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 04:55:54,571 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:55:54,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:55:54,572 INFO L85 PathProgramCache]: Analyzing trace with hash -45666451, now seen corresponding path program 1 times [2022-01-19 04:55:54,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:55:54,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975624816] [2022-01-19 04:55:54,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:55:54,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:55:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:55:54,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:55:54,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:55:54,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975624816] [2022-01-19 04:55:54,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975624816] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:55:54,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:55:54,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:55:54,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124898696] [2022-01-19 04:55:54,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:55:54,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:55:54,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:55:54,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:55:54,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:55:54,801 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 113 [2022-01-19 04:55:54,802 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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-01-19 04:55:54,802 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:55:54,802 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 113 [2022-01-19 04:55:54,802 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:55:55,125 INFO L129 PetriNetUnfolder]: 357/1165 cut-off events. [2022-01-19 04:55:55,125 INFO L130 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-01-19 04:55:55,130 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 1165 events. 357/1165 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7974 event pairs, 56 based on Foata normal form. 0/1131 useless extension candidates. Maximal degree in co-relation 1791. Up to 333 conditions per place. [2022-01-19 04:55:55,132 INFO L132 encePairwiseOnDemand]: 106/113 looper letters, 20 selfloop transitions, 3 changer transitions 48/149 dead transitions. [2022-01-19 04:55:55,133 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 149 transitions, 446 flow [2022-01-19 04:55:55,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:55:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:55:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2022-01-19 04:55:55,136 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8751229105211407 [2022-01-19 04:55:55,136 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2022-01-19 04:55:55,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2022-01-19 04:55:55,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:55:55,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2022-01-19 04:55:55,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.88888888888889) internal successors, (890), 9 states have internal predecessors, (890), 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-01-19 04:55:55,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-01-19 04:55:55,142 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-01-19 04:55:55,142 INFO L186 Difference]: Start difference. First operand has 115 places, 106 transitions, 222 flow. Second operand 9 states and 890 transitions. [2022-01-19 04:55:55,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 149 transitions, 446 flow [2022-01-19 04:55:55,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 149 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 04:55:55,146 INFO L242 Difference]: Finished difference. Result has 128 places, 96 transitions, 237 flow [2022-01-19 04:55:55,147 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=237, PETRI_PLACES=128, PETRI_TRANSITIONS=96} [2022-01-19 04:55:55,147 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 10 predicate places. [2022-01-19 04:55:55,148 INFO L470 AbstractCegarLoop]: Abstraction has has 128 places, 96 transitions, 237 flow [2022-01-19 04:55:55,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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-01-19 04:55:55,148 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:55:55,148 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:55:55,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 04:55:55,149 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:55:55,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:55:55,153 INFO L85 PathProgramCache]: Analyzing trace with hash -806024468, now seen corresponding path program 1 times [2022-01-19 04:55:55,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:55:55,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115635194] [2022-01-19 04:55:55,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:55:55,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:55:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:55:55,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:55:55,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:55:55,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115635194] [2022-01-19 04:55:55,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115635194] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:55:55,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:55:55,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 04:55:55,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406401975] [2022-01-19 04:55:55,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:55:55,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 04:55:55,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:55:55,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 04:55:55,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-01-19 04:55:55,430 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-01-19 04:55:55,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 96 transitions, 237 flow. Second operand has 11 states, 11 states have (on average 90.36363636363636) internal successors, (994), 11 states have internal predecessors, (994), 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-01-19 04:55:55,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:55:55,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-01-19 04:55:55,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:55:55,699 INFO L129 PetriNetUnfolder]: 287/713 cut-off events. [2022-01-19 04:55:55,700 INFO L130 PetriNetUnfolder]: For 635/640 co-relation queries the response was YES. [2022-01-19 04:55:55,702 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1660 conditions, 713 events. 287/713 cut-off events. For 635/640 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3872 event pairs, 107 based on Foata normal form. 21/693 useless extension candidates. Maximal degree in co-relation 1598. Up to 261 conditions per place. [2022-01-19 04:55:55,706 INFO L132 encePairwiseOnDemand]: 100/113 looper letters, 16 selfloop transitions, 11 changer transitions 34/138 dead transitions. [2022-01-19 04:55:55,706 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 138 transitions, 473 flow [2022-01-19 04:55:55,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 04:55:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 04:55:55,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1488 transitions. [2022-01-19 04:55:55,709 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8230088495575221 [2022-01-19 04:55:55,709 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1488 transitions. [2022-01-19 04:55:55,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1488 transitions. [2022-01-19 04:55:55,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:55:55,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1488 transitions. [2022-01-19 04:55:55,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 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-01-19 04:55:55,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 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-01-19 04:55:55,716 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 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-01-19 04:55:55,716 INFO L186 Difference]: Start difference. First operand has 128 places, 96 transitions, 237 flow. Second operand 16 states and 1488 transitions. [2022-01-19 04:55:55,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 138 transitions, 473 flow [2022-01-19 04:55:55,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 138 transitions, 452 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-01-19 04:55:55,724 INFO L242 Difference]: Finished difference. Result has 132 places, 102 transitions, 316 flow [2022-01-19 04:55:55,724 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=316, PETRI_PLACES=132, PETRI_TRANSITIONS=102} [2022-01-19 04:55:55,725 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 14 predicate places. [2022-01-19 04:55:55,726 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 102 transitions, 316 flow [2022-01-19 04:55:55,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.36363636363636) internal successors, (994), 11 states have internal predecessors, (994), 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-01-19 04:55:55,726 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:55:55,726 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:55:55,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 04:55:55,727 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:55:55,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:55:55,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1225042893, now seen corresponding path program 1 times [2022-01-19 04:55:55,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:55:55,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508265445] [2022-01-19 04:55:55,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:55:55,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:55:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:55:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:55:55,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:55:55,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508265445] [2022-01-19 04:55:55,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508265445] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:55:55,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:55:55,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:55:55,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95518181] [2022-01-19 04:55:55,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:55:55,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:55:55,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:55:55,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:55:55,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:55:55,930 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-01-19 04:55:55,930 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 102 transitions, 316 flow. Second operand has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 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-01-19 04:55:55,930 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:55:55,930 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-01-19 04:55:55,930 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:55:56,203 INFO L129 PetriNetUnfolder]: 232/630 cut-off events. [2022-01-19 04:55:56,204 INFO L130 PetriNetUnfolder]: For 1857/1915 co-relation queries the response was YES. [2022-01-19 04:55:56,207 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2069 conditions, 630 events. 232/630 cut-off events. For 1857/1915 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3480 event pairs, 29 based on Foata normal form. 15/616 useless extension candidates. Maximal degree in co-relation 1995. Up to 194 conditions per place. [2022-01-19 04:55:56,209 INFO L132 encePairwiseOnDemand]: 104/113 looper letters, 25 selfloop transitions, 7 changer transitions 25/136 dead transitions. [2022-01-19 04:55:56,209 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 136 transitions, 676 flow [2022-01-19 04:55:56,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 04:55:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 04:55:56,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1054 transitions. [2022-01-19 04:55:56,212 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8479485116653258 [2022-01-19 04:55:56,212 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1054 transitions. [2022-01-19 04:55:56,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1054 transitions. [2022-01-19 04:55:56,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:55:56,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1054 transitions. [2022-01-19 04:55:56,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 95.81818181818181) internal successors, (1054), 11 states have internal predecessors, (1054), 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-01-19 04:55:56,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 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-01-19 04:55:56,219 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 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-01-19 04:55:56,219 INFO L186 Difference]: Start difference. First operand has 132 places, 102 transitions, 316 flow. Second operand 11 states and 1054 transitions. [2022-01-19 04:55:56,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 136 transitions, 676 flow [2022-01-19 04:55:56,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 136 transitions, 650 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-01-19 04:55:56,226 INFO L242 Difference]: Finished difference. Result has 134 places, 104 transitions, 365 flow [2022-01-19 04:55:56,227 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=365, PETRI_PLACES=134, PETRI_TRANSITIONS=104} [2022-01-19 04:55:56,228 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 16 predicate places. [2022-01-19 04:55:56,228 INFO L470 AbstractCegarLoop]: Abstraction has has 134 places, 104 transitions, 365 flow [2022-01-19 04:55:56,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 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-01-19 04:55:56,228 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:55:56,228 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:55:56,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 04:55:56,229 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:55:56,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:55:56,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1494926741, now seen corresponding path program 1 times [2022-01-19 04:55:56,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:55:56,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101330656] [2022-01-19 04:55:56,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:55:56,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:55:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:55:56,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:55:56,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:55:56,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101330656] [2022-01-19 04:55:56,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101330656] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:55:56,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:55:56,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 04:55:56,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544611193] [2022-01-19 04:55:56,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:55:56,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 04:55:56,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:55:56,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 04:55:56,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-01-19 04:55:56,497 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-01-19 04:55:56,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 104 transitions, 365 flow. Second operand has 11 states, 11 states have (on average 90.54545454545455) internal successors, (996), 11 states have internal predecessors, (996), 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-01-19 04:55:56,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:55:56,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-01-19 04:55:56,498 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:55:56,794 INFO L129 PetriNetUnfolder]: 177/521 cut-off events. [2022-01-19 04:55:56,794 INFO L130 PetriNetUnfolder]: For 2699/2737 co-relation queries the response was YES. [2022-01-19 04:55:56,797 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2088 conditions, 521 events. 177/521 cut-off events. For 2699/2737 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2592 event pairs, 12 based on Foata normal form. 8/499 useless extension candidates. Maximal degree in co-relation 2008. Up to 160 conditions per place. [2022-01-19 04:55:56,800 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 25 selfloop transitions, 12 changer transitions 17/131 dead transitions. [2022-01-19 04:55:56,800 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 131 transitions, 732 flow [2022-01-19 04:55:56,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 04:55:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 04:55:56,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1565 transitions. [2022-01-19 04:55:56,803 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8146798542425819 [2022-01-19 04:55:56,803 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1565 transitions. [2022-01-19 04:55:56,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1565 transitions. [2022-01-19 04:55:56,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:55:56,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1565 transitions. [2022-01-19 04:55:56,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 92.05882352941177) internal successors, (1565), 17 states have internal predecessors, (1565), 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-01-19 04:55:56,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 113.0) internal successors, (2034), 18 states have internal predecessors, (2034), 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-01-19 04:55:56,810 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 113.0) internal successors, (2034), 18 states have internal predecessors, (2034), 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-01-19 04:55:56,810 INFO L186 Difference]: Start difference. First operand has 134 places, 104 transitions, 365 flow. Second operand 17 states and 1565 transitions. [2022-01-19 04:55:56,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 131 transitions, 732 flow [2022-01-19 04:55:56,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 131 transitions, 690 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-01-19 04:55:56,817 INFO L242 Difference]: Finished difference. Result has 149 places, 106 transitions, 434 flow [2022-01-19 04:55:56,817 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=434, PETRI_PLACES=149, PETRI_TRANSITIONS=106} [2022-01-19 04:55:56,819 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 31 predicate places. [2022-01-19 04:55:56,819 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 106 transitions, 434 flow [2022-01-19 04:55:56,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.54545454545455) internal successors, (996), 11 states have internal predecessors, (996), 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-01-19 04:55:56,820 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:55:56,820 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:55:56,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 04:55:56,820 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:55:56,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:55:56,821 INFO L85 PathProgramCache]: Analyzing trace with hash -469378898, now seen corresponding path program 1 times [2022-01-19 04:55:56,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:55:56,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524810547] [2022-01-19 04:55:56,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:55:56,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:55:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:55:56,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:55:56,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:55:56,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524810547] [2022-01-19 04:55:56,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524810547] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:55:56,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:55:56,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 04:55:56,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838456394] [2022-01-19 04:55:56,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:55:56,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 04:55:56,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:55:56,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 04:55:56,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-01-19 04:55:56,985 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-01-19 04:55:56,986 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 106 transitions, 434 flow. Second operand has 9 states, 9 states have (on average 91.66666666666667) internal successors, (825), 9 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-01-19 04:55:56,986 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:55:56,986 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-01-19 04:55:56,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:55:57,181 INFO L129 PetriNetUnfolder]: 176/543 cut-off events. [2022-01-19 04:55:57,182 INFO L130 PetriNetUnfolder]: For 4993/5036 co-relation queries the response was YES. [2022-01-19 04:55:57,184 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2512 conditions, 543 events. 176/543 cut-off events. For 4993/5036 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2844 event pairs, 33 based on Foata normal form. 19/524 useless extension candidates. Maximal degree in co-relation 2423. Up to 172 conditions per place. [2022-01-19 04:55:57,186 INFO L132 encePairwiseOnDemand]: 102/113 looper letters, 21 selfloop transitions, 10 changer transitions 29/138 dead transitions. [2022-01-19 04:55:57,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 138 transitions, 985 flow [2022-01-19 04:55:57,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 04:55:57,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 04:55:57,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1219 transitions. [2022-01-19 04:55:57,189 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8298162014976175 [2022-01-19 04:55:57,189 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1219 transitions. [2022-01-19 04:55:57,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1219 transitions. [2022-01-19 04:55:57,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:55:57,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1219 transitions. [2022-01-19 04:55:57,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 93.76923076923077) internal successors, (1219), 13 states have internal predecessors, (1219), 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-01-19 04:55:57,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 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-01-19 04:55:57,194 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 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-01-19 04:55:57,194 INFO L186 Difference]: Start difference. First operand has 149 places, 106 transitions, 434 flow. Second operand 13 states and 1219 transitions. [2022-01-19 04:55:57,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 138 transitions, 985 flow [2022-01-19 04:55:57,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 138 transitions, 867 flow, removed 55 selfloop flow, removed 16 redundant places. [2022-01-19 04:55:57,202 INFO L242 Difference]: Finished difference. Result has 143 places, 107 transitions, 467 flow [2022-01-19 04:55:57,204 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=467, PETRI_PLACES=143, PETRI_TRANSITIONS=107} [2022-01-19 04:55:57,206 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2022-01-19 04:55:57,206 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 107 transitions, 467 flow [2022-01-19 04:55:57,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.66666666666667) internal successors, (825), 9 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-01-19 04:55:57,207 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:55:57,207 INFO L254 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] [2022-01-19 04:55:57,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 04:55:57,207 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:55:57,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:55:57,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1390069999, now seen corresponding path program 1 times [2022-01-19 04:55:57,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:55:57,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881942523] [2022-01-19 04:55:57,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:55:57,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:55:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:55:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:55:57,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:55:57,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881942523] [2022-01-19 04:55:57,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881942523] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:55:57,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:55:57,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 04:55:57,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818362380] [2022-01-19 04:55:57,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:55:57,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 04:55:57,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:55:57,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 04:55:57,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-01-19 04:55:57,427 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 113 [2022-01-19 04:55:57,428 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 107 transitions, 467 flow. Second operand has 13 states, 13 states have (on average 88.53846153846153) internal successors, (1151), 13 states have internal predecessors, (1151), 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-01-19 04:55:57,428 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:55:57,428 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 113 [2022-01-19 04:55:57,428 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:55:57,704 INFO L129 PetriNetUnfolder]: 120/423 cut-off events. [2022-01-19 04:55:57,705 INFO L130 PetriNetUnfolder]: For 3392/3515 co-relation queries the response was YES. [2022-01-19 04:55:57,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1892 conditions, 423 events. 120/423 cut-off events. For 3392/3515 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2085 event pairs, 18 based on Foata normal form. 7/401 useless extension candidates. Maximal degree in co-relation 1804. Up to 159 conditions per place. [2022-01-19 04:55:57,708 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 29 selfloop transitions, 11 changer transitions 10/125 dead transitions. [2022-01-19 04:55:57,708 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 125 transitions, 791 flow [2022-01-19 04:55:57,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 04:55:57,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 04:55:57,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1260 transitions. [2022-01-19 04:55:57,711 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7964601769911505 [2022-01-19 04:55:57,711 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1260 transitions. [2022-01-19 04:55:57,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1260 transitions. [2022-01-19 04:55:57,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:55:57,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1260 transitions. [2022-01-19 04:55:57,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 90.0) internal successors, (1260), 14 states have internal predecessors, (1260), 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-01-19 04:55:57,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-01-19 04:55:57,715 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-01-19 04:55:57,715 INFO L186 Difference]: Start difference. First operand has 143 places, 107 transitions, 467 flow. Second operand 14 states and 1260 transitions. [2022-01-19 04:55:57,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 125 transitions, 791 flow [2022-01-19 04:55:57,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 125 transitions, 746 flow, removed 15 selfloop flow, removed 8 redundant places. [2022-01-19 04:55:57,722 INFO L242 Difference]: Finished difference. Result has 149 places, 110 transitions, 528 flow [2022-01-19 04:55:57,722 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=528, PETRI_PLACES=149, PETRI_TRANSITIONS=110} [2022-01-19 04:55:57,722 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 31 predicate places. [2022-01-19 04:55:57,722 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 110 transitions, 528 flow [2022-01-19 04:55:57,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 88.53846153846153) internal successors, (1151), 13 states have internal predecessors, (1151), 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-01-19 04:55:57,723 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:55:57,723 INFO L254 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] [2022-01-19 04:55:57,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 04:55:57,723 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:55:57,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:55:57,724 INFO L85 PathProgramCache]: Analyzing trace with hash 343569897, now seen corresponding path program 1 times [2022-01-19 04:55:57,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:55:57,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836339596] [2022-01-19 04:55:57,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:55:57,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:55:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:55:57,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:55:57,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:55:57,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836339596] [2022-01-19 04:55:57,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836339596] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:55:57,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:55:57,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:55:57,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080816602] [2022-01-19 04:55:57,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:55:57,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:55:57,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:55:57,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:55:57,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:55:57,791 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-01-19 04:55:57,792 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 110 transitions, 528 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 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-01-19 04:55:57,792 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:55:57,792 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-01-19 04:55:57,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:55:58,116 INFO L129 PetriNetUnfolder]: 1056/2179 cut-off events. [2022-01-19 04:55:58,116 INFO L130 PetriNetUnfolder]: For 27256/27465 co-relation queries the response was YES. [2022-01-19 04:55:58,126 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9538 conditions, 2179 events. 1056/2179 cut-off events. For 27256/27465 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 14852 event pairs, 44 based on Foata normal form. 122/2220 useless extension candidates. Maximal degree in co-relation 9452. Up to 635 conditions per place. [2022-01-19 04:55:58,136 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 108 selfloop transitions, 15 changer transitions 23/226 dead transitions. [2022-01-19 04:55:58,136 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 226 transitions, 2169 flow [2022-01-19 04:55:58,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:55:58,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:55:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 974 transitions. [2022-01-19 04:55:58,138 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8619469026548673 [2022-01-19 04:55:58,138 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 974 transitions. [2022-01-19 04:55:58,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 974 transitions. [2022-01-19 04:55:58,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:55:58,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 974 transitions. [2022-01-19 04:55:58,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.4) internal successors, (974), 10 states have internal predecessors, (974), 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-01-19 04:55:58,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 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-01-19 04:55:58,142 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 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-01-19 04:55:58,142 INFO L186 Difference]: Start difference. First operand has 149 places, 110 transitions, 528 flow. Second operand 10 states and 974 transitions. [2022-01-19 04:55:58,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 226 transitions, 2169 flow [2022-01-19 04:55:58,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 226 transitions, 1846 flow, removed 142 selfloop flow, removed 10 redundant places. [2022-01-19 04:55:58,162 INFO L242 Difference]: Finished difference. Result has 148 places, 123 transitions, 580 flow [2022-01-19 04:55:58,162 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=580, PETRI_PLACES=148, PETRI_TRANSITIONS=123} [2022-01-19 04:55:58,163 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 30 predicate places. [2022-01-19 04:55:58,163 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 123 transitions, 580 flow [2022-01-19 04:55:58,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 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-01-19 04:55:58,163 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:55:58,163 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:55:58,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 04:55:58,163 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:55:58,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:55:58,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1864530944, now seen corresponding path program 1 times [2022-01-19 04:55:58,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:55:58,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661249757] [2022-01-19 04:55:58,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:55:58,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:55:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:55:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:55:58,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:55:58,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661249757] [2022-01-19 04:55:58,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661249757] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:55:58,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:55:58,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 04:55:58,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757988942] [2022-01-19 04:55:58,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:55:58,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 04:55:58,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:55:58,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 04:55:58,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-19 04:55:58,313 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 113 [2022-01-19 04:55:58,314 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 123 transitions, 580 flow. Second operand has 11 states, 11 states have (on average 89.72727272727273) internal successors, (987), 11 states have internal predecessors, (987), 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-01-19 04:55:58,314 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:55:58,314 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 113 [2022-01-19 04:55:58,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:55:58,620 INFO L129 PetriNetUnfolder]: 229/1022 cut-off events. [2022-01-19 04:55:58,620 INFO L130 PetriNetUnfolder]: For 4185/4377 co-relation queries the response was YES. [2022-01-19 04:55:58,625 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3495 conditions, 1022 events. 229/1022 cut-off events. For 4185/4377 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8229 event pairs, 55 based on Foata normal form. 31/977 useless extension candidates. Maximal degree in co-relation 3405. Up to 167 conditions per place. [2022-01-19 04:55:58,628 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 32 selfloop transitions, 19 changer transitions 0/140 dead transitions. [2022-01-19 04:55:58,628 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 140 transitions, 881 flow [2022-01-19 04:55:58,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 04:55:58,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 04:55:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1186 transitions. [2022-01-19 04:55:58,631 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.807351940095303 [2022-01-19 04:55:58,631 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1186 transitions. [2022-01-19 04:55:58,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1186 transitions. [2022-01-19 04:55:58,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:55:58,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1186 transitions. [2022-01-19 04:55:58,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 91.23076923076923) internal successors, (1186), 13 states have internal predecessors, (1186), 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-01-19 04:55:58,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 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-01-19 04:55:58,637 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 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-01-19 04:55:58,637 INFO L186 Difference]: Start difference. First operand has 148 places, 123 transitions, 580 flow. Second operand 13 states and 1186 transitions. [2022-01-19 04:55:58,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 140 transitions, 881 flow [2022-01-19 04:55:58,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 140 transitions, 849 flow, removed 15 selfloop flow, removed 1 redundant places. [2022-01-19 04:55:58,648 INFO L242 Difference]: Finished difference. Result has 166 places, 131 transitions, 769 flow [2022-01-19 04:55:58,648 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=769, PETRI_PLACES=166, PETRI_TRANSITIONS=131} [2022-01-19 04:55:58,649 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 48 predicate places. [2022-01-19 04:55:58,649 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 131 transitions, 769 flow [2022-01-19 04:55:58,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.72727272727273) internal successors, (987), 11 states have internal predecessors, (987), 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-01-19 04:55:58,649 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:55:58,650 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:55:58,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 04:55:58,650 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:55:58,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:55:58,650 INFO L85 PathProgramCache]: Analyzing trace with hash -848625642, now seen corresponding path program 1 times [2022-01-19 04:55:58,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:55:58,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293947743] [2022-01-19 04:55:58,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:55:58,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:55:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:55:58,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:55:58,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:55:58,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293947743] [2022-01-19 04:55:58,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293947743] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:55:58,724 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:55:58,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:55:58,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435108673] [2022-01-19 04:55:58,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:55:58,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:55:58,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:55:58,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:55:58,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:55:58,726 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-01-19 04:55:58,727 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 131 transitions, 769 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 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-01-19 04:55:58,727 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:55:58,727 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-01-19 04:55:58,727 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:55:59,120 INFO L129 PetriNetUnfolder]: 1013/2420 cut-off events. [2022-01-19 04:55:59,120 INFO L130 PetriNetUnfolder]: For 14831/15024 co-relation queries the response was YES. [2022-01-19 04:55:59,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10045 conditions, 2420 events. 1013/2420 cut-off events. For 14831/15024 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 18805 event pairs, 27 based on Foata normal form. 162/2545 useless extension candidates. Maximal degree in co-relation 9950. Up to 513 conditions per place. [2022-01-19 04:55:59,141 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 99 selfloop transitions, 28 changer transitions 50/256 dead transitions. [2022-01-19 04:55:59,141 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 256 transitions, 2451 flow [2022-01-19 04:55:59,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 04:55:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 04:55:59,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1266 transitions. [2022-01-19 04:55:59,143 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8618107556160653 [2022-01-19 04:55:59,143 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1266 transitions. [2022-01-19 04:55:59,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1266 transitions. [2022-01-19 04:55:59,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:55:59,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1266 transitions. [2022-01-19 04:55:59,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 97.38461538461539) internal successors, (1266), 13 states have internal predecessors, (1266), 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-01-19 04:55:59,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 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-01-19 04:55:59,147 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 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-01-19 04:55:59,147 INFO L186 Difference]: Start difference. First operand has 166 places, 131 transitions, 769 flow. Second operand 13 states and 1266 transitions. [2022-01-19 04:55:59,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 256 transitions, 2451 flow [2022-01-19 04:55:59,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 256 transitions, 2237 flow, removed 81 selfloop flow, removed 7 redundant places. [2022-01-19 04:55:59,170 INFO L242 Difference]: Finished difference. Result has 177 places, 137 transitions, 781 flow [2022-01-19 04:55:59,170 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=781, PETRI_PLACES=177, PETRI_TRANSITIONS=137} [2022-01-19 04:55:59,171 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 59 predicate places. [2022-01-19 04:55:59,171 INFO L470 AbstractCegarLoop]: Abstraction has has 177 places, 137 transitions, 781 flow [2022-01-19 04:55:59,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 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-01-19 04:55:59,171 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:55:59,171 INFO L254 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] [2022-01-19 04:55:59,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 04:55:59,172 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:55:59,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:55:59,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1618040239, now seen corresponding path program 1 times [2022-01-19 04:55:59,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:55:59,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042908268] [2022-01-19 04:55:59,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:55:59,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:55:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:55:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:55:59,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:55:59,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042908268] [2022-01-19 04:55:59,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042908268] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:55:59,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:55:59,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:55:59,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355936552] [2022-01-19 04:55:59,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:55:59,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:55:59,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:55:59,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:55:59,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:55:59,232 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 113 [2022-01-19 04:55:59,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 137 transitions, 781 flow. Second operand has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 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-01-19 04:55:59,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:55:59,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 113 [2022-01-19 04:55:59,233 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:55:59,514 INFO L129 PetriNetUnfolder]: 356/1791 cut-off events. [2022-01-19 04:55:59,514 INFO L130 PetriNetUnfolder]: For 6769/7263 co-relation queries the response was YES. [2022-01-19 04:55:59,525 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6342 conditions, 1791 events. 356/1791 cut-off events. For 6769/7263 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 17795 event pairs, 22 based on Foata normal form. 33/1744 useless extension candidates. Maximal degree in co-relation 6245. Up to 393 conditions per place. [2022-01-19 04:55:59,531 INFO L132 encePairwiseOnDemand]: 107/113 looper letters, 43 selfloop transitions, 3 changer transitions 19/175 dead transitions. [2022-01-19 04:55:59,531 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 175 transitions, 1278 flow [2022-01-19 04:55:59,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:55:59,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:55:59,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 873 transitions. [2022-01-19 04:55:59,532 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8584070796460177 [2022-01-19 04:55:59,533 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 873 transitions. [2022-01-19 04:55:59,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 873 transitions. [2022-01-19 04:55:59,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:55:59,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 873 transitions. [2022-01-19 04:55:59,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.0) internal successors, (873), 9 states have internal predecessors, (873), 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-01-19 04:55:59,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-01-19 04:55:59,535 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-01-19 04:55:59,535 INFO L186 Difference]: Start difference. First operand has 177 places, 137 transitions, 781 flow. Second operand 9 states and 873 transitions. [2022-01-19 04:55:59,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 175 transitions, 1278 flow [2022-01-19 04:55:59,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 175 transitions, 1106 flow, removed 79 selfloop flow, removed 12 redundant places. [2022-01-19 04:55:59,567 INFO L242 Difference]: Finished difference. Result has 174 places, 137 transitions, 702 flow [2022-01-19 04:55:59,568 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=702, PETRI_PLACES=174, PETRI_TRANSITIONS=137} [2022-01-19 04:55:59,568 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 56 predicate places. [2022-01-19 04:55:59,568 INFO L470 AbstractCegarLoop]: Abstraction has has 174 places, 137 transitions, 702 flow [2022-01-19 04:55:59,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 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-01-19 04:55:59,568 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:55:59,569 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:55:59,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 04:55:59,569 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:55:59,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:55:59,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1184710144, now seen corresponding path program 1 times [2022-01-19 04:55:59,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:55:59,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222118542] [2022-01-19 04:55:59,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:55:59,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:55:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:55:59,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:55:59,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:55:59,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222118542] [2022-01-19 04:55:59,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222118542] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:55:59,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:55:59,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:55:59,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034119852] [2022-01-19 04:55:59,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:55:59,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:55:59,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:55:59,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:55:59,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:55:59,643 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-01-19 04:55:59,643 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 137 transitions, 702 flow. Second operand has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 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-01-19 04:55:59,643 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:55:59,643 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-01-19 04:55:59,644 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:56:00,202 INFO L129 PetriNetUnfolder]: 1261/3074 cut-off events. [2022-01-19 04:56:00,202 INFO L130 PetriNetUnfolder]: For 10250/10498 co-relation queries the response was YES. [2022-01-19 04:56:00,217 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12141 conditions, 3074 events. 1261/3074 cut-off events. For 10250/10498 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 27022 event pairs, 44 based on Foata normal form. 203/3232 useless extension candidates. Maximal degree in co-relation 12094. Up to 616 conditions per place. [2022-01-19 04:56:00,221 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 39 selfloop transitions, 12 changer transitions 117/244 dead transitions. [2022-01-19 04:56:00,222 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 244 transitions, 1928 flow [2022-01-19 04:56:00,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 04:56:00,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 04:56:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1527 transitions. [2022-01-19 04:56:00,224 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8445796460176991 [2022-01-19 04:56:00,224 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1527 transitions. [2022-01-19 04:56:00,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1527 transitions. [2022-01-19 04:56:00,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:56:00,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1527 transitions. [2022-01-19 04:56:00,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 95.4375) internal successors, (1527), 16 states have internal predecessors, (1527), 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-01-19 04:56:00,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 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-01-19 04:56:00,229 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 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-01-19 04:56:00,229 INFO L186 Difference]: Start difference. First operand has 174 places, 137 transitions, 702 flow. Second operand 16 states and 1527 transitions. [2022-01-19 04:56:00,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 244 transitions, 1928 flow [2022-01-19 04:56:00,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 244 transitions, 1710 flow, removed 89 selfloop flow, removed 18 redundant places. [2022-01-19 04:56:00,262 INFO L242 Difference]: Finished difference. Result has 171 places, 108 transitions, 452 flow [2022-01-19 04:56:00,262 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=452, PETRI_PLACES=171, PETRI_TRANSITIONS=108} [2022-01-19 04:56:00,262 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 53 predicate places. [2022-01-19 04:56:00,263 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 108 transitions, 452 flow [2022-01-19 04:56:00,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 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-01-19 04:56:00,263 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:56:00,263 INFO L254 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-01-19 04:56:00,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 04:56:00,263 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:56:00,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:56:00,264 INFO L85 PathProgramCache]: Analyzing trace with hash -428460024, now seen corresponding path program 1 times [2022-01-19 04:56:00,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:56:00,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848496257] [2022-01-19 04:56:00,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:56:00,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:56:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:56:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:56:00,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:56:00,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848496257] [2022-01-19 04:56:00,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848496257] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:56:00,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:56:00,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:56:00,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635430272] [2022-01-19 04:56:00,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:56:00,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:56:00,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:56:00,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:56:00,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:56:00,345 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-01-19 04:56:00,346 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 108 transitions, 452 flow. Second operand has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 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-01-19 04:56:00,346 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:56:00,346 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-01-19 04:56:00,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:56:00,441 INFO L129 PetriNetUnfolder]: 26/227 cut-off events. [2022-01-19 04:56:00,442 INFO L130 PetriNetUnfolder]: For 398/407 co-relation queries the response was YES. [2022-01-19 04:56:00,442 INFO L84 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 227 events. 26/227 cut-off events. For 398/407 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 688 event pairs, 1 based on Foata normal form. 4/228 useless extension candidates. Maximal degree in co-relation 554. Up to 26 conditions per place. [2022-01-19 04:56:00,443 INFO L132 encePairwiseOnDemand]: 107/113 looper letters, 18 selfloop transitions, 1 changer transitions 20/121 dead transitions. [2022-01-19 04:56:00,443 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 121 transitions, 593 flow [2022-01-19 04:56:00,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 04:56:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 04:56:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 666 transitions. [2022-01-19 04:56:00,444 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8419721871049305 [2022-01-19 04:56:00,444 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 666 transitions. [2022-01-19 04:56:00,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 666 transitions. [2022-01-19 04:56:00,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:56:00,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 666 transitions. [2022-01-19 04:56:00,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 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-01-19 04:56:00,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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-01-19 04:56:00,447 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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-01-19 04:56:00,447 INFO L186 Difference]: Start difference. First operand has 171 places, 108 transitions, 452 flow. Second operand 7 states and 666 transitions. [2022-01-19 04:56:00,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 121 transitions, 593 flow [2022-01-19 04:56:00,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 121 transitions, 429 flow, removed 32 selfloop flow, removed 35 redundant places. [2022-01-19 04:56:00,449 INFO L242 Difference]: Finished difference. Result has 127 places, 101 transitions, 270 flow [2022-01-19 04:56:00,450 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=270, PETRI_PLACES=127, PETRI_TRANSITIONS=101} [2022-01-19 04:56:00,450 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 9 predicate places. [2022-01-19 04:56:00,450 INFO L470 AbstractCegarLoop]: Abstraction has has 127 places, 101 transitions, 270 flow [2022-01-19 04:56:00,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 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-01-19 04:56:00,451 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:56:00,451 INFO L254 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-01-19 04:56:00,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 04:56:00,451 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:56:00,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:56:00,451 INFO L85 PathProgramCache]: Analyzing trace with hash -850870412, now seen corresponding path program 2 times [2022-01-19 04:56:00,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:56:00,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476896873] [2022-01-19 04:56:00,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:56:00,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:56:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:56:00,475 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 04:56:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:56:00,520 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 04:56:00,520 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 04:56:00,521 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-19 04:56:00,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-19 04:56:00,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-19 04:56:00,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-19 04:56:00,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-19 04:56:00,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-19 04:56:00,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 04:56:00,525 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:56:00,528 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 04:56:00,528 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 04:56:00,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 04:56:00 BasicIcfg [2022-01-19 04:56:00,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 04:56:00,615 INFO L158 Benchmark]: Toolchain (without parser) took 7839.34ms. Allocated memory was 381.7MB in the beginning and 669.0MB in the end (delta: 287.3MB). Free memory was 326.5MB in the beginning and 405.4MB in the end (delta: -78.9MB). Peak memory consumption was 211.4MB. Max. memory is 16.0GB. [2022-01-19 04:56:00,615 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 381.7MB. Free memory is still 345.4MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:56:00,616 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.70ms. Allocated memory is still 381.7MB. Free memory was 326.2MB in the beginning and 341.7MB in the end (delta: -15.5MB). Peak memory consumption was 16.1MB. Max. memory is 16.0GB. [2022-01-19 04:56:00,616 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.44ms. Allocated memory is still 381.7MB. Free memory was 341.7MB in the beginning and 338.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 04:56:00,616 INFO L158 Benchmark]: Boogie Preprocessor took 20.58ms. Allocated memory is still 381.7MB. Free memory was 338.6MB in the beginning and 336.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:56:00,616 INFO L158 Benchmark]: RCFGBuilder took 738.65ms. Allocated memory is still 381.7MB. Free memory was 336.5MB in the beginning and 265.2MB in the end (delta: 71.3MB). Peak memory consumption was 71.3MB. Max. memory is 16.0GB. [2022-01-19 04:56:00,617 INFO L158 Benchmark]: TraceAbstraction took 6627.25ms. Allocated memory was 381.7MB in the beginning and 669.0MB in the end (delta: 287.3MB). Free memory was 264.1MB in the beginning and 405.4MB in the end (delta: -141.3MB). Peak memory consumption was 149.2MB. Max. memory is 16.0GB. [2022-01-19 04:56:00,619 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 381.7MB. Free memory is still 345.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 412.70ms. Allocated memory is still 381.7MB. Free memory was 326.2MB in the beginning and 341.7MB in the end (delta: -15.5MB). Peak memory consumption was 16.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 33.44ms. Allocated memory is still 381.7MB. Free memory was 341.7MB in the beginning and 338.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 20.58ms. Allocated memory is still 381.7MB. Free memory was 338.6MB in the beginning and 336.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 738.65ms. Allocated memory is still 381.7MB. Free memory was 336.5MB in the beginning and 265.2MB in the end (delta: 71.3MB). Peak memory consumption was 71.3MB. Max. memory is 16.0GB. * TraceAbstraction took 6627.25ms. Allocated memory was 381.7MB in the beginning and 669.0MB in the end (delta: 287.3MB). Free memory was 264.1MB in the beginning and 405.4MB in the end (delta: -141.3MB). Peak memory consumption was 149.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t1492; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1492, ((void *)0), P0, ((void *)0))=-2, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1493; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1493, ((void *)0), P1, ((void *)0))=-1, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1494; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1494, ((void *)0), P2, ((void *)0))=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=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=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 816]: 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: 818]: 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: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 139 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 610 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 610 mSDsluCounter, 551 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 861 mSDsCounter, 188 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1432 IncrementalHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 188 mSolverCounterUnsat, 107 mSDtfsCounter, 1432 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=781occurred in iteration=10, InterpolantAutomatonStates: 151, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1093 NumberOfCodeBlocks, 1093 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 993 ConstructedInterpolants, 0 QuantifiedInterpolants, 5265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-01-19 04:56:00,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...