/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-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:35:39,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:35:39,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:35:39,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:35:39,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:35:39,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:35:39,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:35:39,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:35:39,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:35:39,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:35:39,188 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:35:39,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:35:39,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:35:39,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:35:39,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:35:39,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:35:39,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:35:39,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:35:39,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:35:39,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:35:39,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:35:39,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:35:39,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:35:39,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:35:39,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:35:39,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:35:39,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:35:39,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:35:39,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:35:39,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:35:39,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:35:39,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:35:39,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:35:39,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:35:39,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:35:39,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:35:39,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:35:39,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:35:39,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:35:39,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:35:39,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:35:39,212 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-VariableLbe.epf [2023-01-28 00:35:39,233 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:35:39,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:35:39,234 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:35:39,234 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:35:39,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:35:39,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:35:39,235 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:35:39,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:35:39,235 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:35:39,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:35:39,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:35:39,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:35:39,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:35:39,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:35:39,236 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:35:39,236 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:35:39,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:35:39,236 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:35:39,237 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:35:39,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:35:39,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:35:39,237 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:35:39,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:35:39,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:35:39,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:35:39,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:35:39,237 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:35:39,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:35:39,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:35:39,238 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:35:39,238 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:35:39,238 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:35:39,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:35:39,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:35:39,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:35:39,444 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:35:39,444 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:35:39,445 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 00:35:40,441 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:35:40,629 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:35:40,629 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 00:35:40,637 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e28d5e7c/9fde8486264c4e43813640c5b5043ccf/FLAG5c5b97dca [2023-01-28 00:35:40,661 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e28d5e7c/9fde8486264c4e43813640c5b5043ccf [2023-01-28 00:35:40,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:35:40,664 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:35:40,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:35:40,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:35:40,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:35:40,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:35:40" (1/1) ... [2023-01-28 00:35:40,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b0fce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:35:40, skipping insertion in model container [2023-01-28 00:35:40,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:35:40" (1/1) ... [2023-01-28 00:35:40,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:35:40,721 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:35:40,847 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-28 00:35:41,016 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:35:41,026 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:35:41,035 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-28 00:35:41,097 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:35:41,117 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:35:41,117 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:35:41,123 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:35:41,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:35:41 WrapperNode [2023-01-28 00:35:41,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:35:41,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:35:41,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:35:41,125 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:35:41,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:35:41" (1/1) ... [2023-01-28 00:35:41,154 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:35:41" (1/1) ... [2023-01-28 00:35:41,182 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-01-28 00:35:41,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:35:41,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:35:41,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:35:41,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:35:41,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:35:41" (1/1) ... [2023-01-28 00:35:41,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:35:41" (1/1) ... [2023-01-28 00:35:41,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:35:41" (1/1) ... [2023-01-28 00:35:41,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:35:41" (1/1) ... [2023-01-28 00:35:41,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:35:41" (1/1) ... [2023-01-28 00:35:41,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:35:41" (1/1) ... [2023-01-28 00:35:41,216 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:35:41" (1/1) ... [2023-01-28 00:35:41,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:35:41" (1/1) ... [2023-01-28 00:35:41,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:35:41,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:35:41,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:35:41,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:35:41,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:35:41" (1/1) ... [2023-01-28 00:35:41,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:35:41,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:35:41,246 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) [2023-01-28 00:35:41,248 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 [2023-01-28 00:35:41,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:35:41,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:35:41,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:35:41,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:35:41,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:35:41,273 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:35:41,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:35:41,277 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:35:41,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:35:41,278 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:35:41,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:35:41,278 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-28 00:35:41,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-28 00:35:41,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:35:41,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:35:41,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:35:41,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:35:41,279 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:35:41,407 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:35:41,409 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:35:41,655 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:35:41,792 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:35:41,792 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:35:41,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:35:41 BoogieIcfgContainer [2023-01-28 00:35:41,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:35:41,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:35:41,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:35:41,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:35:41,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:35:40" (1/3) ... [2023-01-28 00:35:41,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23fc75b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:35:41, skipping insertion in model container [2023-01-28 00:35:41,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:35:41" (2/3) ... [2023-01-28 00:35:41,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23fc75b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:35:41, skipping insertion in model container [2023-01-28 00:35:41,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:35:41" (3/3) ... [2023-01-28 00:35:41,800 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 00:35:41,811 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:35:41,811 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:35:41,811 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:35:41,860 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:35:41,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2023-01-28 00:35:41,934 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-01-28 00:35:41,935 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:35:41,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-28 00:35:41,941 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2023-01-28 00:35:41,947 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2023-01-28 00:35:41,950 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:35:41,959 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2023-01-28 00:35:41,962 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2023-01-28 00:35:41,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2023-01-28 00:35:41,991 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-01-28 00:35:41,991 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:35:41,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-28 00:35:41,994 INFO L119 LiptonReduction]: Number of co-enabled transitions 3286 [2023-01-28 00:35:44,689 INFO L134 LiptonReduction]: Checked pairs total: 9320 [2023-01-28 00:35:44,689 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-01-28 00:35:44,702 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:35:44,714 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1808280d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:35:44,714 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-28 00:35:44,719 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-28 00:35:44,719 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:35:44,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:35:44,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 00:35:44,721 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:35:44,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:35:44,737 INFO L85 PathProgramCache]: Analyzing trace with hash 550583, now seen corresponding path program 1 times [2023-01-28 00:35:44,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:35:44,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876156701] [2023-01-28 00:35:44,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:35:44,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:35:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:35:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:35:45,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:35:45,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876156701] [2023-01-28 00:35:45,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876156701] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:35:45,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:35:45,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:35:45,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357167697] [2023-01-28 00:35:45,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:35:45,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:35:45,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:35:45,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:35:45,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:35:45,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 239 [2023-01-28 00:35:45,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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) [2023-01-28 00:35:45,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:35:45,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 239 [2023-01-28 00:35:45,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:35:45,864 INFO L130 PetriNetUnfolder]: 5879/8061 cut-off events. [2023-01-28 00:35:45,864 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2023-01-28 00:35:45,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16205 conditions, 8061 events. 5879/8061 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 40811 event pairs, 3031 based on Foata normal form. 0/7718 useless extension candidates. Maximal degree in co-relation 16193. Up to 6367 conditions per place. [2023-01-28 00:35:45,904 INFO L137 encePairwiseOnDemand]: 235/239 looper letters, 43 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2023-01-28 00:35:45,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 219 flow [2023-01-28 00:35:45,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:35:45,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:35:45,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-01-28 00:35:45,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5550906555090656 [2023-01-28 00:35:45,917 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-01-28 00:35:45,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-01-28 00:35:45,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:35:45,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-01-28 00:35:45,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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) [2023-01-28 00:35:45,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 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) [2023-01-28 00:35:45,928 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 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) [2023-01-28 00:35:45,929 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 398 transitions. [2023-01-28 00:35:45,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 219 flow [2023-01-28 00:35:45,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 212 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 00:35:45,934 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 72 flow [2023-01-28 00:35:45,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-01-28 00:35:45,938 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-01-28 00:35:45,939 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 72 flow [2023-01-28 00:35:45,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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) [2023-01-28 00:35:45,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:35:45,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:35:45,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:35:45,939 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:35:45,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:35:45,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1379440190, now seen corresponding path program 1 times [2023-01-28 00:35:45,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:35:45,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878210077] [2023-01-28 00:35:45,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:35:45,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:35:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:35:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:35:46,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:35:46,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878210077] [2023-01-28 00:35:46,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878210077] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:35:46,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:35:46,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:35:46,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968602611] [2023-01-28 00:35:46,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:35:46,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:35:46,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:35:46,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:35:46,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:35:46,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 239 [2023-01-28 00:35:46,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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) [2023-01-28 00:35:46,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:35:46,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 239 [2023-01-28 00:35:46,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:35:49,091 INFO L130 PetriNetUnfolder]: 29383/39666 cut-off events. [2023-01-28 00:35:49,092 INFO L131 PetriNetUnfolder]: For 1789/1789 co-relation queries the response was YES. [2023-01-28 00:35:49,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81710 conditions, 39666 events. 29383/39666 cut-off events. For 1789/1789 co-relation queries the response was YES. Maximal size of possible extension queue 1211. Compared 222269 event pairs, 9149 based on Foata normal form. 1620/41286 useless extension candidates. Maximal degree in co-relation 81700. Up to 20333 conditions per place. [2023-01-28 00:35:49,259 INFO L137 encePairwiseOnDemand]: 228/239 looper letters, 46 selfloop transitions, 9 changer transitions 37/92 dead transitions. [2023-01-28 00:35:49,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 92 transitions, 390 flow [2023-01-28 00:35:49,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:35:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:35:49,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2023-01-28 00:35:49,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501255230125523 [2023-01-28 00:35:49,261 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2023-01-28 00:35:49,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2023-01-28 00:35:49,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:35:49,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2023-01-28 00:35:49,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 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) [2023-01-28 00:35:49,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 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) [2023-01-28 00:35:49,265 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 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) [2023-01-28 00:35:49,265 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 5 states and 599 transitions. [2023-01-28 00:35:49,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 92 transitions, 390 flow [2023-01-28 00:35:49,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 92 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:35:49,269 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 158 flow [2023-01-28 00:35:49,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-01-28 00:35:49,269 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-01-28 00:35:49,269 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 158 flow [2023-01-28 00:35:49,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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) [2023-01-28 00:35:49,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:35:49,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:35:49,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:35:49,270 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:35:49,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:35:49,270 INFO L85 PathProgramCache]: Analyzing trace with hash 186974941, now seen corresponding path program 1 times [2023-01-28 00:35:49,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:35:49,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383397071] [2023-01-28 00:35:49,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:35:49,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:35:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:35:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:35:49,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:35:49,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383397071] [2023-01-28 00:35:49,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383397071] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:35:49,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:35:49,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:35:49,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554909257] [2023-01-28 00:35:49,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:35:49,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:35:49,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:35:49,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:35:49,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:35:49,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 239 [2023-01-28 00:35:49,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 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) [2023-01-28 00:35:49,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:35:49,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 239 [2023-01-28 00:35:49,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:35:51,665 INFO L130 PetriNetUnfolder]: 19814/28015 cut-off events. [2023-01-28 00:35:51,666 INFO L131 PetriNetUnfolder]: For 18332/19494 co-relation queries the response was YES. [2023-01-28 00:35:51,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73386 conditions, 28015 events. 19814/28015 cut-off events. For 18332/19494 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 172337 event pairs, 6031 based on Foata normal form. 1452/28467 useless extension candidates. Maximal degree in co-relation 73372. Up to 17065 conditions per place. [2023-01-28 00:35:51,850 INFO L137 encePairwiseOnDemand]: 235/239 looper letters, 40 selfloop transitions, 3 changer transitions 30/81 dead transitions. [2023-01-28 00:35:51,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 456 flow [2023-01-28 00:35:51,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:35:51,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:35:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 623 transitions. [2023-01-28 00:35:51,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5213389121338912 [2023-01-28 00:35:51,853 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 623 transitions. [2023-01-28 00:35:51,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 623 transitions. [2023-01-28 00:35:51,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:35:51,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 623 transitions. [2023-01-28 00:35:51,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 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) [2023-01-28 00:35:51,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 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) [2023-01-28 00:35:51,856 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 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) [2023-01-28 00:35:51,856 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 158 flow. Second operand 5 states and 623 transitions. [2023-01-28 00:35:51,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 456 flow [2023-01-28 00:35:51,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 81 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:35:51,917 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 155 flow [2023-01-28 00:35:51,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2023-01-28 00:35:51,918 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2023-01-28 00:35:51,921 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 155 flow [2023-01-28 00:35:51,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 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) [2023-01-28 00:35:51,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:35:51,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:35:51,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:35:51,922 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:35:51,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:35:51,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1440527167, now seen corresponding path program 1 times [2023-01-28 00:35:51,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:35:51,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905342883] [2023-01-28 00:35:51,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:35:51,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:35:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:35:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:35:52,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:35:52,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905342883] [2023-01-28 00:35:52,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905342883] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:35:52,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:35:52,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:35:52,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273406178] [2023-01-28 00:35:52,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:35:52,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:35:52,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:35:52,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:35:52,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:35:52,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 239 [2023-01-28 00:35:52,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 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) [2023-01-28 00:35:52,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:35:52,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 239 [2023-01-28 00:35:52,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:35:54,527 INFO L130 PetriNetUnfolder]: 23650/32214 cut-off events. [2023-01-28 00:35:54,528 INFO L131 PetriNetUnfolder]: For 31070/31070 co-relation queries the response was YES. [2023-01-28 00:35:54,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88122 conditions, 32214 events. 23650/32214 cut-off events. For 31070/31070 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 181542 event pairs, 1706 based on Foata normal form. 1089/33303 useless extension candidates. Maximal degree in co-relation 88105. Up to 16733 conditions per place. [2023-01-28 00:35:54,660 INFO L137 encePairwiseOnDemand]: 228/239 looper letters, 64 selfloop transitions, 13 changer transitions 47/124 dead transitions. [2023-01-28 00:35:54,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 124 transitions, 703 flow [2023-01-28 00:35:54,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:35:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:35:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 824 transitions. [2023-01-28 00:35:54,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49252839210998206 [2023-01-28 00:35:54,665 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 824 transitions. [2023-01-28 00:35:54,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 824 transitions. [2023-01-28 00:35:54,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:35:54,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 824 transitions. [2023-01-28 00:35:54,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 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) [2023-01-28 00:35:54,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-01-28 00:35:54,671 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-01-28 00:35:54,671 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 155 flow. Second operand 7 states and 824 transitions. [2023-01-28 00:35:54,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 124 transitions, 703 flow [2023-01-28 00:35:54,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 124 transitions, 685 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-01-28 00:35:54,850 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 264 flow [2023-01-28 00:35:54,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=264, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-01-28 00:35:54,852 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2023-01-28 00:35:54,852 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 264 flow [2023-01-28 00:35:54,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 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) [2023-01-28 00:35:54,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:35:54,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:35:54,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:35:54,853 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:35:54,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:35:54,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1708114326, now seen corresponding path program 1 times [2023-01-28 00:35:54,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:35:54,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922809311] [2023-01-28 00:35:54,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:35:54,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:35:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:35:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:35:55,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:35:55,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922809311] [2023-01-28 00:35:55,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922809311] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:35:55,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:35:55,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:35:55,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415770331] [2023-01-28 00:35:55,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:35:55,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:35:55,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:35:55,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:35:55,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:35:55,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 239 [2023-01-28 00:35:55,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 264 flow. Second operand has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 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) [2023-01-28 00:35:55,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:35:55,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 239 [2023-01-28 00:35:55,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:35:57,367 INFO L130 PetriNetUnfolder]: 21881/29812 cut-off events. [2023-01-28 00:35:57,368 INFO L131 PetriNetUnfolder]: For 59292/59292 co-relation queries the response was YES. [2023-01-28 00:35:57,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92727 conditions, 29812 events. 21881/29812 cut-off events. For 59292/59292 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 163498 event pairs, 3883 based on Foata normal form. 1016/30828 useless extension candidates. Maximal degree in co-relation 92706. Up to 12277 conditions per place. [2023-01-28 00:35:57,505 INFO L137 encePairwiseOnDemand]: 229/239 looper letters, 74 selfloop transitions, 9 changer transitions 48/131 dead transitions. [2023-01-28 00:35:57,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 131 transitions, 894 flow [2023-01-28 00:35:57,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:35:57,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:35:57,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 820 transitions. [2023-01-28 00:35:57,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49013747758517634 [2023-01-28 00:35:57,507 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 820 transitions. [2023-01-28 00:35:57,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 820 transitions. [2023-01-28 00:35:57,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:35:57,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 820 transitions. [2023-01-28 00:35:57,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 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) [2023-01-28 00:35:57,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-01-28 00:35:57,511 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-01-28 00:35:57,511 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 264 flow. Second operand 7 states and 820 transitions. [2023-01-28 00:35:57,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 131 transitions, 894 flow [2023-01-28 00:35:57,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 131 transitions, 882 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-01-28 00:35:57,669 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 361 flow [2023-01-28 00:35:57,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=361, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2023-01-28 00:35:57,670 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places. [2023-01-28 00:35:57,670 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 361 flow [2023-01-28 00:35:57,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 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) [2023-01-28 00:35:57,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:35:57,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:35:57,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:35:57,671 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:35:57,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:35:57,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1935461966, now seen corresponding path program 1 times [2023-01-28 00:35:57,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:35:57,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37386660] [2023-01-28 00:35:57,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:35:57,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:35:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:35:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:35:57,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:35:57,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37386660] [2023-01-28 00:35:57,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37386660] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:35:57,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:35:57,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:35:57,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680545398] [2023-01-28 00:35:57,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:35:57,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:35:57,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:35:57,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:35:57,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:35:57,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 239 [2023-01-28 00:35:57,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 361 flow. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 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) [2023-01-28 00:35:57,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:35:57,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 239 [2023-01-28 00:35:57,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:00,021 INFO L130 PetriNetUnfolder]: 20594/28067 cut-off events. [2023-01-28 00:36:00,021 INFO L131 PetriNetUnfolder]: For 86799/86799 co-relation queries the response was YES. [2023-01-28 00:36:00,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95742 conditions, 28067 events. 20594/28067 cut-off events. For 86799/86799 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 152510 event pairs, 3868 based on Foata normal form. 718/28785 useless extension candidates. Maximal degree in co-relation 95713. Up to 14625 conditions per place. [2023-01-28 00:36:00,240 INFO L137 encePairwiseOnDemand]: 228/239 looper letters, 69 selfloop transitions, 26 changer transitions 38/133 dead transitions. [2023-01-28 00:36:00,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 133 transitions, 997 flow [2023-01-28 00:36:00,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:36:00,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:36:00,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 824 transitions. [2023-01-28 00:36:00,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49252839210998206 [2023-01-28 00:36:00,242 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 824 transitions. [2023-01-28 00:36:00,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 824 transitions. [2023-01-28 00:36:00,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:00,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 824 transitions. [2023-01-28 00:36:00,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 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) [2023-01-28 00:36:00,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-01-28 00:36:00,246 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-01-28 00:36:00,246 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 361 flow. Second operand 7 states and 824 transitions. [2023-01-28 00:36:00,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 133 transitions, 997 flow [2023-01-28 00:36:00,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 133 transitions, 963 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-01-28 00:36:00,667 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 505 flow [2023-01-28 00:36:00,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=505, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2023-01-28 00:36:00,667 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2023-01-28 00:36:00,667 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 505 flow [2023-01-28 00:36:00,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 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) [2023-01-28 00:36:00,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:00,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:00,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:36:00,668 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:36:00,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:00,668 INFO L85 PathProgramCache]: Analyzing trace with hash 63229805, now seen corresponding path program 1 times [2023-01-28 00:36:00,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:00,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293053715] [2023-01-28 00:36:00,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:00,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:36:00,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:00,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293053715] [2023-01-28 00:36:00,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293053715] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:00,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:00,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:36:00,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86817053] [2023-01-28 00:36:00,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:00,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:36:00,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:00,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:36:00,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:36:00,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 239 [2023-01-28 00:36:00,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 505 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 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) [2023-01-28 00:36:00,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:00,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 239 [2023-01-28 00:36:00,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:02,479 INFO L130 PetriNetUnfolder]: 11248/16742 cut-off events. [2023-01-28 00:36:02,479 INFO L131 PetriNetUnfolder]: For 43565/46199 co-relation queries the response was YES. [2023-01-28 00:36:02,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53416 conditions, 16742 events. 11248/16742 cut-off events. For 43565/46199 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 108178 event pairs, 1930 based on Foata normal form. 1992/18324 useless extension candidates. Maximal degree in co-relation 53385. Up to 10241 conditions per place. [2023-01-28 00:36:02,617 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 105 selfloop transitions, 10 changer transitions 0/137 dead transitions. [2023-01-28 00:36:02,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 137 transitions, 1263 flow [2023-01-28 00:36:02,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:36:02,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:36:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 618 transitions. [2023-01-28 00:36:02,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5171548117154812 [2023-01-28 00:36:02,620 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 618 transitions. [2023-01-28 00:36:02,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 618 transitions. [2023-01-28 00:36:02,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:02,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 618 transitions. [2023-01-28 00:36:02,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 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) [2023-01-28 00:36:02,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 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) [2023-01-28 00:36:02,622 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 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) [2023-01-28 00:36:02,623 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 505 flow. Second operand 5 states and 618 transitions. [2023-01-28 00:36:02,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 137 transitions, 1263 flow [2023-01-28 00:36:02,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 137 transitions, 1225 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-01-28 00:36:02,716 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 560 flow [2023-01-28 00:36:02,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=560, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2023-01-28 00:36:02,717 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2023-01-28 00:36:02,718 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 560 flow [2023-01-28 00:36:02,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 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) [2023-01-28 00:36:02,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:02,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:02,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:36:02,719 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:36:02,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:02,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2130505944, now seen corresponding path program 1 times [2023-01-28 00:36:02,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:02,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304015953] [2023-01-28 00:36:02,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:02,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:36:02,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:02,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304015953] [2023-01-28 00:36:02,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304015953] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:02,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:02,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:36:02,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6606016] [2023-01-28 00:36:02,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:02,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:36:02,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:02,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:36:02,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:36:02,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 239 [2023-01-28 00:36:02,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 560 flow. Second operand has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 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) [2023-01-28 00:36:02,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:02,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 239 [2023-01-28 00:36:02,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:05,402 INFO L130 PetriNetUnfolder]: 23655/33599 cut-off events. [2023-01-28 00:36:05,402 INFO L131 PetriNetUnfolder]: For 124602/124602 co-relation queries the response was YES. [2023-01-28 00:36:05,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140983 conditions, 33599 events. 23655/33599 cut-off events. For 124602/124602 co-relation queries the response was YES. Maximal size of possible extension queue 1018. Compared 205690 event pairs, 5404 based on Foata normal form. 453/34052 useless extension candidates. Maximal degree in co-relation 140952. Up to 14407 conditions per place. [2023-01-28 00:36:05,630 INFO L137 encePairwiseOnDemand]: 228/239 looper letters, 90 selfloop transitions, 24 changer transitions 59/173 dead transitions. [2023-01-28 00:36:05,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 173 transitions, 1551 flow [2023-01-28 00:36:05,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:36:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:36:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 823 transitions. [2023-01-28 00:36:05,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4919306634787806 [2023-01-28 00:36:05,633 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 823 transitions. [2023-01-28 00:36:05,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 823 transitions. [2023-01-28 00:36:05,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:05,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 823 transitions. [2023-01-28 00:36:05,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.57142857142857) internal successors, (823), 7 states have internal predecessors, (823), 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) [2023-01-28 00:36:05,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-01-28 00:36:05,636 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-01-28 00:36:05,636 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 560 flow. Second operand 7 states and 823 transitions. [2023-01-28 00:36:05,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 173 transitions, 1551 flow [2023-01-28 00:36:05,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 173 transitions, 1536 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 00:36:05,947 INFO L231 Difference]: Finished difference. Result has 78 places, 67 transitions, 719 flow [2023-01-28 00:36:05,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=719, PETRI_PLACES=78, PETRI_TRANSITIONS=67} [2023-01-28 00:36:05,948 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places. [2023-01-28 00:36:05,948 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 67 transitions, 719 flow [2023-01-28 00:36:05,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 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) [2023-01-28 00:36:05,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:05,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:05,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:36:05,949 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:36:05,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:05,949 INFO L85 PathProgramCache]: Analyzing trace with hash 686602672, now seen corresponding path program 1 times [2023-01-28 00:36:05,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:05,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6102633] [2023-01-28 00:36:05,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:05,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:06,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:36:06,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:06,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6102633] [2023-01-28 00:36:06,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6102633] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:06,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:06,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:36:06,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314460388] [2023-01-28 00:36:06,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:06,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:36:06,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:06,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:36:06,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:36:06,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 239 [2023-01-28 00:36:06,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 67 transitions, 719 flow. Second operand has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 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) [2023-01-28 00:36:06,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:06,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 239 [2023-01-28 00:36:06,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:07,174 INFO L130 PetriNetUnfolder]: 8059/12761 cut-off events. [2023-01-28 00:36:07,174 INFO L131 PetriNetUnfolder]: For 43834/45499 co-relation queries the response was YES. [2023-01-28 00:36:07,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48397 conditions, 12761 events. 8059/12761 cut-off events. For 43834/45499 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 87232 event pairs, 1254 based on Foata normal form. 1645/14123 useless extension candidates. Maximal degree in co-relation 48359. Up to 4533 conditions per place. [2023-01-28 00:36:07,261 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 131 selfloop transitions, 14 changer transitions 3/172 dead transitions. [2023-01-28 00:36:07,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 172 transitions, 1947 flow [2023-01-28 00:36:07,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:36:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:36:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 744 transitions. [2023-01-28 00:36:07,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188284518828452 [2023-01-28 00:36:07,263 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 744 transitions. [2023-01-28 00:36:07,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 744 transitions. [2023-01-28 00:36:07,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:07,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 744 transitions. [2023-01-28 00:36:07,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 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) [2023-01-28 00:36:07,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 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) [2023-01-28 00:36:07,266 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 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) [2023-01-28 00:36:07,266 INFO L175 Difference]: Start difference. First operand has 78 places, 67 transitions, 719 flow. Second operand 6 states and 744 transitions. [2023-01-28 00:36:07,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 172 transitions, 1947 flow [2023-01-28 00:36:07,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 172 transitions, 1927 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-01-28 00:36:07,366 INFO L231 Difference]: Finished difference. Result has 79 places, 76 transitions, 827 flow [2023-01-28 00:36:07,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=827, PETRI_PLACES=79, PETRI_TRANSITIONS=76} [2023-01-28 00:36:07,366 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2023-01-28 00:36:07,366 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 76 transitions, 827 flow [2023-01-28 00:36:07,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 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) [2023-01-28 00:36:07,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:07,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:07,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:36:07,367 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:36:07,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:07,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1129076371, now seen corresponding path program 1 times [2023-01-28 00:36:07,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:07,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462512544] [2023-01-28 00:36:07,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:07,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:07,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:36:07,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:07,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462512544] [2023-01-28 00:36:07,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462512544] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:07,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:07,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:36:07,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732056048] [2023-01-28 00:36:07,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:07,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:36:07,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:07,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:36:07,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:36:07,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 239 [2023-01-28 00:36:07,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 827 flow. Second operand has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 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) [2023-01-28 00:36:07,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:07,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 239 [2023-01-28 00:36:07,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:09,482 INFO L130 PetriNetUnfolder]: 14400/21493 cut-off events. [2023-01-28 00:36:09,482 INFO L131 PetriNetUnfolder]: For 139873/139873 co-relation queries the response was YES. [2023-01-28 00:36:09,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104695 conditions, 21493 events. 14400/21493 cut-off events. For 139873/139873 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 135594 event pairs, 1282 based on Foata normal form. 162/21655 useless extension candidates. Maximal degree in co-relation 104654. Up to 9078 conditions per place. [2023-01-28 00:36:09,621 INFO L137 encePairwiseOnDemand]: 227/239 looper letters, 103 selfloop transitions, 51 changer transitions 52/206 dead transitions. [2023-01-28 00:36:09,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 206 transitions, 2447 flow [2023-01-28 00:36:09,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:36:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:36:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 804 transitions. [2023-01-28 00:36:09,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4805738194859534 [2023-01-28 00:36:09,627 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 804 transitions. [2023-01-28 00:36:09,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 804 transitions. [2023-01-28 00:36:09,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:09,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 804 transitions. [2023-01-28 00:36:09,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 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) [2023-01-28 00:36:09,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-01-28 00:36:09,631 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-01-28 00:36:09,631 INFO L175 Difference]: Start difference. First operand has 79 places, 76 transitions, 827 flow. Second operand 7 states and 804 transitions. [2023-01-28 00:36:09,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 206 transitions, 2447 flow [2023-01-28 00:36:10,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 206 transitions, 2291 flow, removed 63 selfloop flow, removed 3 redundant places. [2023-01-28 00:36:10,482 INFO L231 Difference]: Finished difference. Result has 88 places, 95 transitions, 1331 flow [2023-01-28 00:36:10,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1331, PETRI_PLACES=88, PETRI_TRANSITIONS=95} [2023-01-28 00:36:10,482 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 43 predicate places. [2023-01-28 00:36:10,482 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 95 transitions, 1331 flow [2023-01-28 00:36:10,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 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) [2023-01-28 00:36:10,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:10,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:10,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:36:10,483 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:36:10,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:10,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1166073557, now seen corresponding path program 2 times [2023-01-28 00:36:10,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:10,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777043288] [2023-01-28 00:36:10,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:10,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:36:10,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:10,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777043288] [2023-01-28 00:36:10,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777043288] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:10,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:10,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:36:10,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22662098] [2023-01-28 00:36:10,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:10,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:36:10,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:10,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:36:10,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:36:10,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 239 [2023-01-28 00:36:10,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 95 transitions, 1331 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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) [2023-01-28 00:36:10,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:10,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 239 [2023-01-28 00:36:10,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:11,595 INFO L130 PetriNetUnfolder]: 5908/9580 cut-off events. [2023-01-28 00:36:11,596 INFO L131 PetriNetUnfolder]: For 51270/52394 co-relation queries the response was YES. [2023-01-28 00:36:11,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41653 conditions, 9580 events. 5908/9580 cut-off events. For 51270/52394 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 64972 event pairs, 981 based on Foata normal form. 819/10217 useless extension candidates. Maximal degree in co-relation 41607. Up to 3135 conditions per place. [2023-01-28 00:36:11,659 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 157 selfloop transitions, 18 changer transitions 22/234 dead transitions. [2023-01-28 00:36:11,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 234 transitions, 3280 flow [2023-01-28 00:36:11,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:36:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:36:11,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 868 transitions. [2023-01-28 00:36:11,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188284518828452 [2023-01-28 00:36:11,689 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 868 transitions. [2023-01-28 00:36:11,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 868 transitions. [2023-01-28 00:36:11,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:11,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 868 transitions. [2023-01-28 00:36:11,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 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) [2023-01-28 00:36:11,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-01-28 00:36:11,693 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-01-28 00:36:11,693 INFO L175 Difference]: Start difference. First operand has 88 places, 95 transitions, 1331 flow. Second operand 7 states and 868 transitions. [2023-01-28 00:36:11,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 234 transitions, 3280 flow [2023-01-28 00:36:11,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 234 transitions, 3141 flow, removed 29 selfloop flow, removed 4 redundant places. [2023-01-28 00:36:11,796 INFO L231 Difference]: Finished difference. Result has 89 places, 104 transitions, 1406 flow [2023-01-28 00:36:11,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1406, PETRI_PLACES=89, PETRI_TRANSITIONS=104} [2023-01-28 00:36:11,797 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 44 predicate places. [2023-01-28 00:36:11,797 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 104 transitions, 1406 flow [2023-01-28 00:36:11,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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) [2023-01-28 00:36:11,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:11,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:11,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:36:11,798 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:36:11,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:11,798 INFO L85 PathProgramCache]: Analyzing trace with hash -127019374, now seen corresponding path program 1 times [2023-01-28 00:36:11,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:11,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151303722] [2023-01-28 00:36:11,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:11,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:36:11,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:11,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151303722] [2023-01-28 00:36:11,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151303722] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:11,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:11,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:36:11,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013425418] [2023-01-28 00:36:11,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:11,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:36:11,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:11,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:36:11,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:36:11,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 239 [2023-01-28 00:36:11,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 104 transitions, 1406 flow. Second operand has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 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) [2023-01-28 00:36:11,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:11,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 239 [2023-01-28 00:36:11,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:13,000 INFO L130 PetriNetUnfolder]: 5786/9325 cut-off events. [2023-01-28 00:36:13,000 INFO L131 PetriNetUnfolder]: For 47093/48211 co-relation queries the response was YES. [2023-01-28 00:36:13,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43258 conditions, 9325 events. 5786/9325 cut-off events. For 47093/48211 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 63059 event pairs, 960 based on Foata normal form. 397/9530 useless extension candidates. Maximal degree in co-relation 43211. Up to 3135 conditions per place. [2023-01-28 00:36:13,049 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 110 selfloop transitions, 22 changer transitions 70/235 dead transitions. [2023-01-28 00:36:13,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 235 transitions, 3227 flow [2023-01-28 00:36:13,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 00:36:13,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 00:36:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1087 transitions. [2023-01-28 00:36:13,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053463505346351 [2023-01-28 00:36:13,051 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1087 transitions. [2023-01-28 00:36:13,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1087 transitions. [2023-01-28 00:36:13,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:13,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1087 transitions. [2023-01-28 00:36:13,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.77777777777777) internal successors, (1087), 9 states have internal predecessors, (1087), 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) [2023-01-28 00:36:13,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 239.0) internal successors, (2390), 10 states have internal predecessors, (2390), 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) [2023-01-28 00:36:13,056 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 239.0) internal successors, (2390), 10 states have internal predecessors, (2390), 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) [2023-01-28 00:36:13,056 INFO L175 Difference]: Start difference. First operand has 89 places, 104 transitions, 1406 flow. Second operand 9 states and 1087 transitions. [2023-01-28 00:36:13,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 235 transitions, 3227 flow [2023-01-28 00:36:13,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 235 transitions, 3083 flow, removed 58 selfloop flow, removed 7 redundant places. [2023-01-28 00:36:13,447 INFO L231 Difference]: Finished difference. Result has 93 places, 92 transitions, 1178 flow [2023-01-28 00:36:13,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1178, PETRI_PLACES=93, PETRI_TRANSITIONS=92} [2023-01-28 00:36:13,447 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 48 predicate places. [2023-01-28 00:36:13,447 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 92 transitions, 1178 flow [2023-01-28 00:36:13,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 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) [2023-01-28 00:36:13,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:13,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:13,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 00:36:13,448 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:36:13,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:13,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1919495576, now seen corresponding path program 1 times [2023-01-28 00:36:13,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:13,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824843895] [2023-01-28 00:36:13,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:13,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:14,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:36:14,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:14,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824843895] [2023-01-28 00:36:14,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824843895] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:14,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:14,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 00:36:14,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789837047] [2023-01-28 00:36:14,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:14,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 00:36:14,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:14,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 00:36:14,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-01-28 00:36:14,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 239 [2023-01-28 00:36:14,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 92 transitions, 1178 flow. Second operand has 9 states, 9 states have (on average 104.77777777777777) internal successors, (943), 9 states have internal predecessors, (943), 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) [2023-01-28 00:36:14,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:14,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 239 [2023-01-28 00:36:14,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:15,458 INFO L130 PetriNetUnfolder]: 4009/6682 cut-off events. [2023-01-28 00:36:15,458 INFO L131 PetriNetUnfolder]: For 31919/33065 co-relation queries the response was YES. [2023-01-28 00:36:15,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31378 conditions, 6682 events. 4009/6682 cut-off events. For 31919/33065 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 45155 event pairs, 470 based on Foata normal form. 142/6676 useless extension candidates. Maximal degree in co-relation 31332. Up to 2633 conditions per place. [2023-01-28 00:36:15,493 INFO L137 encePairwiseOnDemand]: 231/239 looper letters, 133 selfloop transitions, 5 changer transitions 44/215 dead transitions. [2023-01-28 00:36:15,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 215 transitions, 2630 flow [2023-01-28 00:36:15,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 00:36:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 00:36:15,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 900 transitions. [2023-01-28 00:36:15,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707112970711297 [2023-01-28 00:36:15,495 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 900 transitions. [2023-01-28 00:36:15,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 900 transitions. [2023-01-28 00:36:15,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:15,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 900 transitions. [2023-01-28 00:36:15,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 112.5) internal successors, (900), 8 states have internal predecessors, (900), 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) [2023-01-28 00:36:15,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 239.0) internal successors, (2151), 9 states have internal predecessors, (2151), 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) [2023-01-28 00:36:15,499 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 239.0) internal successors, (2151), 9 states have internal predecessors, (2151), 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) [2023-01-28 00:36:15,499 INFO L175 Difference]: Start difference. First operand has 93 places, 92 transitions, 1178 flow. Second operand 8 states and 900 transitions. [2023-01-28 00:36:15,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 215 transitions, 2630 flow [2023-01-28 00:36:15,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 215 transitions, 2150 flow, removed 88 selfloop flow, removed 16 redundant places. [2023-01-28 00:36:15,649 INFO L231 Difference]: Finished difference. Result has 88 places, 95 transitions, 997 flow [2023-01-28 00:36:15,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=997, PETRI_PLACES=88, PETRI_TRANSITIONS=95} [2023-01-28 00:36:15,650 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 43 predicate places. [2023-01-28 00:36:15,650 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 95 transitions, 997 flow [2023-01-28 00:36:15,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 104.77777777777777) internal successors, (943), 9 states have internal predecessors, (943), 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) [2023-01-28 00:36:15,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:15,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:15,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 00:36:15,651 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:36:15,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:15,651 INFO L85 PathProgramCache]: Analyzing trace with hash 507347964, now seen corresponding path program 2 times [2023-01-28 00:36:15,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:15,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142067161] [2023-01-28 00:36:15,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:15,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:36:15,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:36:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:36:15,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:36:15,747 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:36:15,748 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-28 00:36:15,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-28 00:36:15,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-28 00:36:15,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-28 00:36:15,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-28 00:36:15,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-28 00:36:15,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-28 00:36:15,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 00:36:15,752 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:15,757 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:36:15,757 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:36:15,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:36:15 BasicIcfg [2023-01-28 00:36:15,832 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:36:15,833 INFO L158 Benchmark]: Toolchain (without parser) took 35169.28ms. Allocated memory was 341.8MB in the beginning and 8.2GB in the end (delta: 7.8GB). Free memory was 280.6MB in the beginning and 6.9GB in the end (delta: -6.6GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-01-28 00:36:15,833 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 341.8MB. Free memory is still 289.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:36:15,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.17ms. Allocated memory is still 341.8MB. Free memory was 280.3MB in the beginning and 256.5MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 00:36:15,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.74ms. Allocated memory is still 341.8MB. Free memory was 256.5MB in the beginning and 254.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:36:15,833 INFO L158 Benchmark]: Boogie Preprocessor took 36.32ms. Allocated memory was 341.8MB in the beginning and 555.7MB in the end (delta: 213.9MB). Free memory was 254.0MB in the beginning and 523.0MB in the end (delta: -269.0MB). Peak memory consumption was 8.7MB. Max. memory is 16.0GB. [2023-01-28 00:36:15,834 INFO L158 Benchmark]: RCFGBuilder took 574.08ms. Allocated memory is still 555.7MB. Free memory was 523.0MB in the beginning and 481.2MB in the end (delta: 41.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. [2023-01-28 00:36:15,834 INFO L158 Benchmark]: TraceAbstraction took 34036.55ms. Allocated memory was 555.7MB in the beginning and 8.2GB in the end (delta: 7.6GB). Free memory was 480.2MB in the beginning and 6.9GB in the end (delta: -6.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-01-28 00:36:15,838 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.08ms. Allocated memory is still 341.8MB. Free memory is still 289.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 459.17ms. Allocated memory is still 341.8MB. Free memory was 280.3MB in the beginning and 256.5MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.74ms. Allocated memory is still 341.8MB. Free memory was 256.5MB in the beginning and 254.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 36.32ms. Allocated memory was 341.8MB in the beginning and 555.7MB in the end (delta: 213.9MB). Free memory was 254.0MB in the beginning and 523.0MB in the end (delta: -269.0MB). Peak memory consumption was 8.7MB. Max. memory is 16.0GB. * RCFGBuilder took 574.08ms. Allocated memory is still 555.7MB. Free memory was 523.0MB in the beginning and 481.2MB in the end (delta: 41.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. * TraceAbstraction took 34036.55ms. Allocated memory was 555.7MB in the beginning and 8.2GB in the end (delta: 7.6GB). Free memory was 480.2MB in the beginning and 6.9GB in the end (delta: -6.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 139 PlacesBefore, 45 PlacesAfterwards, 128 TransitionsBefore, 33 TransitionsAfterwards, 3286 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 9320 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3778, independent: 3551, independent conditional: 0, independent unconditional: 3551, dependent: 227, dependent conditional: 0, dependent unconditional: 227, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1714, independent: 1677, independent conditional: 0, independent unconditional: 1677, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3778, independent: 1874, independent conditional: 0, independent unconditional: 1874, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 1714, unknown conditional: 0, unknown unconditional: 1714] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 161, Positive conditional cache size: 0, Positive unconditional cache size: 161, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t209; [L870] FCALL, FORK 0 pthread_create(&t209, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t209, ((void *)0), P0, ((void *)0))=-1, t209={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t210; [L872] FCALL, FORK 0 pthread_create(&t210, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t210, ((void *)0), P1, ((void *)0))=0, t209={5:0}, t210={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t211; [L874] FCALL, FORK 0 pthread_create(&t211, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t211, ((void *)0), P2, ((void *)0))=1, t209={5:0}, t210={6:0}, t211={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t212; [L876] FCALL, FORK 0 pthread_create(&t212, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t212, ((void *)0), P3, ((void *)0))=2, t209={5:0}, t210={6:0}, t211={7:0}, t212={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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, z=0] [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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, z=0] [L825] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t209={5:0}, t210={6:0}, t211={7:0}, t212={3:0}, weak$$choice2=0, x=2, y=2, z=1] [L889] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, 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: 874]: 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: 876]: 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: 872]: 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: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 33.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 677 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 677 mSDsluCounter, 157 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2079 IncrementalHoareTripleChecker+Invalid, 2134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 72 mSDtfsCounter, 2079 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1406occurred in iteration=11, InterpolantAutomatonStates: 83, 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.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 1495 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! [2023-01-28 00:36:15,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...