/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:12:44,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:12:44,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:12:44,272 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:12:44,272 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:12:44,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:12:44,277 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:12:44,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:12:44,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:12:44,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:12:44,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:12:44,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:12:44,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:12:44,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:12:44,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:12:44,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:12:44,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:12:44,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:12:44,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:12:44,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:12:44,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:12:44,297 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:12:44,298 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:12:44,299 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:12:44,305 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:12:44,305 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:12:44,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:12:44,306 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:12:44,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:12:44,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:12:44,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:12:44,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:12:44,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:12:44,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:12:44,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:12:44,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:12:44,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:12:44,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:12:44,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:12:44,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:12:44,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:12:44,312 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-27 18:12:44,332 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:12:44,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:12:44,333 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:12:44,333 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:12:44,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:12:44,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:12:44,334 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:12:44,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:12:44,334 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:12:44,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:12:44,335 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:12:44,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:12:44,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:12:44,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:12:44,335 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:12:44,335 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:12:44,335 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:12:44,335 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:12:44,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:12:44,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:12:44,335 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:12:44,336 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:12:44,336 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:12:44,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:12:44,336 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:12:44,336 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:12:44,336 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:12:44,336 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:12:44,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:12:44,336 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:12:44,336 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:12:44,336 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 [2023-01-27 18:12:44,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:12:44,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:12:44,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:12:44,557 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:12:44,558 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:12:44,558 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i [2023-01-27 18:12:45,400 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:12:45,664 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:12:45,665 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i [2023-01-27 18:12:45,675 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f9fdad5/fde6827ba84f4d5a868fcbbecf5e1634/FLAG88f9efa84 [2023-01-27 18:12:45,996 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f9fdad5/fde6827ba84f4d5a868fcbbecf5e1634 [2023-01-27 18:12:45,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:12:46,000 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:12:46,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:12:46,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:12:46,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:12:46,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:12:45" (1/1) ... [2023-01-27 18:12:46,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cabae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:46, skipping insertion in model container [2023-01-27 18:12:46,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:12:45" (1/1) ... [2023-01-27 18:12:46,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:12:46,032 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:12:46,119 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/mix044_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-27 18:12:46,267 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:12:46,276 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:12:46,283 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/mix044_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-27 18:12:46,327 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:12:46,362 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:12:46,363 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:12:46,367 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:12:46,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:46 WrapperNode [2023-01-27 18:12:46,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:12:46,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:12:46,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:12:46,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:12:46,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:46" (1/1) ... [2023-01-27 18:12:46,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:46" (1/1) ... [2023-01-27 18:12:46,427 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-01-27 18:12:46,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:12:46,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:12:46,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:12:46,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:12:46,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:46" (1/1) ... [2023-01-27 18:12:46,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:46" (1/1) ... [2023-01-27 18:12:46,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:46" (1/1) ... [2023-01-27 18:12:46,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:46" (1/1) ... [2023-01-27 18:12:46,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:46" (1/1) ... [2023-01-27 18:12:46,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:46" (1/1) ... [2023-01-27 18:12:46,454 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:46" (1/1) ... [2023-01-27 18:12:46,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:46" (1/1) ... [2023-01-27 18:12:46,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:12:46,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:12:46,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:12:46,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:12:46,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:46" (1/1) ... [2023-01-27 18:12:46,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:12:46,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:12:46,502 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-27 18:12:46,520 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-27 18:12:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:12:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:12:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:12:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:12:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:12:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:12:46,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:12:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:12:46,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:12:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:12:46,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:12:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-27 18:12:46,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-27 18:12:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:12:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:12:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:12:46,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:12:46,534 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:12:46,663 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:12:46,665 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:12:46,908 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:12:46,982 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:12:46,983 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:12:46,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:12:46 BoogieIcfgContainer [2023-01-27 18:12:46,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:12:46,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:12:46,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:12:46,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:12:46,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:12:45" (1/3) ... [2023-01-27 18:12:46,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1da73a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:12:46, skipping insertion in model container [2023-01-27 18:12:46,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:46" (2/3) ... [2023-01-27 18:12:46,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1da73a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:12:46, skipping insertion in model container [2023-01-27 18:12:46,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:12:46" (3/3) ... [2023-01-27 18:12:46,990 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_power.oepc_pso.oepc_rmo.oepc.i [2023-01-27 18:12:47,016 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:12:47,016 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:12:47,016 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:12:47,064 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:12:47,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2023-01-27 18:12:47,148 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-01-27 18:12:47,149 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:12:47,153 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 73 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-27 18:12:47,154 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2023-01-27 18:12:47,159 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2023-01-27 18:12:47,162 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:12:47,170 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2023-01-27 18:12:47,172 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2023-01-27 18:12:47,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2023-01-27 18:12:47,197 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-01-27 18:12:47,197 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:12:47,198 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 73 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-27 18:12:47,200 INFO L119 LiptonReduction]: Number of co-enabled transitions 3270 [2023-01-27 18:12:50,234 INFO L134 LiptonReduction]: Checked pairs total: 8670 [2023-01-27 18:12:50,234 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-01-27 18:12:50,244 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:12:50,248 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;@4827a503, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:12:50,248 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-27 18:12:50,250 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-27 18:12:50,250 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:12:50,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:12:50,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-27 18:12:50,251 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-27 18:12:50,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:12:50,255 INFO L85 PathProgramCache]: Analyzing trace with hash 553466, now seen corresponding path program 1 times [2023-01-27 18:12:50,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:12:50,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344666312] [2023-01-27 18:12:50,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:12:50,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:12:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:12:50,505 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-27 18:12:50,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:12:50,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344666312] [2023-01-27 18:12:50,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344666312] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:12:50,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:12:50,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:12:50,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058083587] [2023-01-27 18:12:50,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:12:50,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:12:50,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:12:50,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:12:50,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:12:50,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 242 [2023-01-27 18:12:50,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 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-27 18:12:50,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:12:50,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 242 [2023-01-27 18:12:50,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:12:51,259 INFO L130 PetriNetUnfolder]: 5879/8107 cut-off events. [2023-01-27 18:12:51,259 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2023-01-27 18:12:51,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16251 conditions, 8107 events. 5879/8107 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 40886 event pairs, 2239 based on Foata normal form. 0/7719 useless extension candidates. Maximal degree in co-relation 16239. Up to 6367 conditions per place. [2023-01-27 18:12:51,294 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-01-27 18:12:51,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 215 flow [2023-01-27 18:12:51,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:12:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:12:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-01-27 18:12:51,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5482093663911846 [2023-01-27 18:12:51,308 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-01-27 18:12:51,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-01-27 18:12:51,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:12:51,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-01-27 18:12:51,315 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-27 18:12:51,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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-27 18:12:51,320 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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-27 18:12:51,321 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 398 transitions. [2023-01-27 18:12:51,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 215 flow [2023-01-27 18:12:51,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 18:12:51,328 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-01-27 18:12:51,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-01-27 18:12:51,337 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-01-27 18:12:51,337 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-01-27 18:12:51,338 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-27 18:12:51,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:12:51,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:12:51,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:12:51,339 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-27 18:12:51,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:12:51,341 INFO L85 PathProgramCache]: Analyzing trace with hash -301813989, now seen corresponding path program 1 times [2023-01-27 18:12:51,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:12:51,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712193938] [2023-01-27 18:12:51,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:12:51,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:12:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:12:51,603 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-27 18:12:51,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:12:51,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712193938] [2023-01-27 18:12:51,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712193938] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:12:51,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:12:51,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:12:51,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891152281] [2023-01-27 18:12:51,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:12:51,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:12:51,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:12:51,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:12:51,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:12:51,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-01-27 18:12:51,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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-27 18:12:51,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:12:51,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-01-27 18:12:51,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:12:53,120 INFO L130 PetriNetUnfolder]: 16407/22321 cut-off events. [2023-01-27 18:12:53,120 INFO L131 PetriNetUnfolder]: For 1028/1028 co-relation queries the response was YES. [2023-01-27 18:12:53,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46179 conditions, 22321 events. 16407/22321 cut-off events. For 1028/1028 co-relation queries the response was YES. Maximal size of possible extension queue 730. Compared 117777 event pairs, 5637 based on Foata normal form. 634/22955 useless extension candidates. Maximal degree in co-relation 46169. Up to 13398 conditions per place. [2023-01-27 18:12:53,284 INFO L137 encePairwiseOnDemand]: 233/242 looper letters, 43 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2023-01-27 18:12:53,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 222 flow [2023-01-27 18:12:53,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:12:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:12:53,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-01-27 18:12:53,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5055096418732782 [2023-01-27 18:12:53,286 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-01-27 18:12:53,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-01-27 18:12:53,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:12:53,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-01-27 18:12:53,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 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-27 18:12:53,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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-27 18:12:53,288 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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-27 18:12:53,288 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 367 transitions. [2023-01-27 18:12:53,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 222 flow [2023-01-27 18:12:53,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:12:53,290 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 126 flow [2023-01-27 18:12:53,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-01-27 18:12:53,291 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-01-27 18:12:53,291 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 126 flow [2023-01-27 18:12:53,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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-27 18:12:53,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:12:53,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:12:53,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:12:53,292 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-27 18:12:53,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:12:53,293 INFO L85 PathProgramCache]: Analyzing trace with hash -766301216, now seen corresponding path program 1 times [2023-01-27 18:12:53,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:12:53,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630555690] [2023-01-27 18:12:53,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:12:53,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:12:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:12:53,510 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-27 18:12:53,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:12:53,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630555690] [2023-01-27 18:12:53,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630555690] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:12:53,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:12:53,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:12:53,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534820365] [2023-01-27 18:12:53,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:12:53,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:12:53,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:12:53,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:12:53,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:12:53,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-01-27 18:12:53,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 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-27 18:12:53,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:12:53,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-01-27 18:12:53,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:12:55,036 INFO L130 PetriNetUnfolder]: 16149/21975 cut-off events. [2023-01-27 18:12:55,037 INFO L131 PetriNetUnfolder]: For 8493/8493 co-relation queries the response was YES. [2023-01-27 18:12:55,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55465 conditions, 21975 events. 16149/21975 cut-off events. For 8493/8493 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 114720 event pairs, 1334 based on Foata normal form. 40/22015 useless extension candidates. Maximal degree in co-relation 55453. Up to 12464 conditions per place. [2023-01-27 18:12:55,132 INFO L137 encePairwiseOnDemand]: 233/242 looper letters, 56 selfloop transitions, 12 changer transitions 0/68 dead transitions. [2023-01-27 18:12:55,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 360 flow [2023-01-27 18:12:55,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:12:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:12:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2023-01-27 18:12:55,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010330578512396 [2023-01-27 18:12:55,133 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 485 transitions. [2023-01-27 18:12:55,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 485 transitions. [2023-01-27 18:12:55,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:12:55,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 485 transitions. [2023-01-27 18:12:55,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 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-27 18:12:55,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 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-27 18:12:55,136 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 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-27 18:12:55,136 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 126 flow. Second operand 4 states and 485 transitions. [2023-01-27 18:12:55,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 360 flow [2023-01-27 18:12:55,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:12:55,167 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 198 flow [2023-01-27 18:12:55,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2023-01-27 18:12:55,168 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-01-27 18:12:55,170 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 198 flow [2023-01-27 18:12:55,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 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-27 18:12:55,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:12:55,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:12:55,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:12:55,171 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-27 18:12:55,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:12:55,171 INFO L85 PathProgramCache]: Analyzing trace with hash -766301092, now seen corresponding path program 1 times [2023-01-27 18:12:55,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:12:55,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690951145] [2023-01-27 18:12:55,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:12:55,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:12:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:12:55,345 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-27 18:12:55,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:12:55,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690951145] [2023-01-27 18:12:55,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690951145] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:12:55,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:12:55,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:12:55,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142507039] [2023-01-27 18:12:55,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:12:55,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:12:55,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:12:55,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:12:55,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:12:55,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-01-27 18:12:55,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 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-27 18:12:55,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:12:55,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-01-27 18:12:55,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:12:56,965 INFO L130 PetriNetUnfolder]: 15821/21537 cut-off events. [2023-01-27 18:12:56,966 INFO L131 PetriNetUnfolder]: For 17569/17569 co-relation queries the response was YES. [2023-01-27 18:12:56,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59029 conditions, 21537 events. 15821/21537 cut-off events. For 17569/17569 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 113299 event pairs, 3113 based on Foata normal form. 50/21587 useless extension candidates. Maximal degree in co-relation 59014. Up to 12454 conditions per place. [2023-01-27 18:12:57,047 INFO L137 encePairwiseOnDemand]: 233/242 looper letters, 67 selfloop transitions, 18 changer transitions 0/85 dead transitions. [2023-01-27 18:12:57,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 85 transitions, 524 flow [2023-01-27 18:12:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:12:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:12:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2023-01-27 18:12:57,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5082644628099173 [2023-01-27 18:12:57,048 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2023-01-27 18:12:57,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2023-01-27 18:12:57,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:12:57,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2023-01-27 18:12:57,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 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-27 18:12:57,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 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-27 18:12:57,051 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 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-27 18:12:57,051 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 198 flow. Second operand 4 states and 492 transitions. [2023-01-27 18:12:57,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 85 transitions, 524 flow [2023-01-27 18:12:57,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 85 transitions, 524 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 18:12:57,078 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 356 flow [2023-01-27 18:12:57,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=356, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2023-01-27 18:12:57,080 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2023-01-27 18:12:57,080 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 356 flow [2023-01-27 18:12:57,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 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-27 18:12:57,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:12:57,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:12:57,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:12:57,081 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-27 18:12:57,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:12:57,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2014464055, now seen corresponding path program 1 times [2023-01-27 18:12:57,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:12:57,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609869334] [2023-01-27 18:12:57,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:12:57,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:12:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:12:57,219 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-27 18:12:57,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:12:57,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609869334] [2023-01-27 18:12:57,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609869334] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:12:57,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:12:57,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:12:57,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874020499] [2023-01-27 18:12:57,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:12:57,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:12:57,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:12:57,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:12:57,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:12:57,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242 [2023-01-27 18:12:57,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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-27 18:12:57,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:12:57,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242 [2023-01-27 18:12:57,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:12:58,435 INFO L130 PetriNetUnfolder]: 11814/16707 cut-off events. [2023-01-27 18:12:58,435 INFO L131 PetriNetUnfolder]: For 30380/31665 co-relation queries the response was YES. [2023-01-27 18:12:58,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48469 conditions, 16707 events. 11814/16707 cut-off events. For 30380/31665 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 94564 event pairs, 3764 based on Foata normal form. 529/16986 useless extension candidates. Maximal degree in co-relation 48449. Up to 11170 conditions per place. [2023-01-27 18:12:58,534 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 49 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2023-01-27 18:12:58,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 520 flow [2023-01-27 18:12:58,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:12:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:12:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-01-27 18:12:58,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.522038567493113 [2023-01-27 18:12:58,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-01-27 18:12:58,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-01-27 18:12:58,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:12:58,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-01-27 18:12:58,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 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-27 18:12:58,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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-27 18:12:58,538 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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-27 18:12:58,538 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 356 flow. Second operand 3 states and 379 transitions. [2023-01-27 18:12:58,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 520 flow [2023-01-27 18:12:58,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 520 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 18:12:58,554 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 370 flow [2023-01-27 18:12:58,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=370, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2023-01-27 18:12:58,555 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2023-01-27 18:12:58,555 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 370 flow [2023-01-27 18:12:58,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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-27 18:12:58,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:12:58,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:12:58,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:12:58,556 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-27 18:12:58,556 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:12:58,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1612032770, now seen corresponding path program 1 times [2023-01-27 18:12:58,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:12:58,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82119191] [2023-01-27 18:12:58,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:12:58,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:12:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:12:58,732 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-27 18:12:58,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:12:58,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82119191] [2023-01-27 18:12:58,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82119191] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:12:58,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:12:58,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:12:58,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035000621] [2023-01-27 18:12:58,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:12:58,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:12:58,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:12:58,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:12:58,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:12:58,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-01-27 18:12:58,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 370 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 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-27 18:12:58,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:12:58,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-01-27 18:12:58,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:12:59,827 INFO L130 PetriNetUnfolder]: 10081/14725 cut-off events. [2023-01-27 18:12:59,827 INFO L131 PetriNetUnfolder]: For 30769/32043 co-relation queries the response was YES. [2023-01-27 18:12:59,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43752 conditions, 14725 events. 10081/14725 cut-off events. For 30769/32043 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 90072 event pairs, 1589 based on Foata normal form. 1539/16047 useless extension candidates. Maximal degree in co-relation 43729. Up to 8988 conditions per place. [2023-01-27 18:12:59,902 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 116 selfloop transitions, 10 changer transitions 0/139 dead transitions. [2023-01-27 18:12:59,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 139 transitions, 1193 flow [2023-01-27 18:12:59,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:12:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:12:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2023-01-27 18:12:59,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5049586776859504 [2023-01-27 18:12:59,904 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 611 transitions. [2023-01-27 18:12:59,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 611 transitions. [2023-01-27 18:12:59,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:12:59,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 611 transitions. [2023-01-27 18:12:59,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 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-27 18:12:59,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 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-27 18:12:59,914 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 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-27 18:12:59,915 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 370 flow. Second operand 5 states and 611 transitions. [2023-01-27 18:12:59,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 139 transitions, 1193 flow [2023-01-27 18:12:59,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 139 transitions, 1167 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:12:59,938 INFO L231 Difference]: Finished difference. Result has 59 places, 61 transitions, 437 flow [2023-01-27 18:12:59,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=437, PETRI_PLACES=59, PETRI_TRANSITIONS=61} [2023-01-27 18:12:59,940 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2023-01-27 18:12:59,940 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 61 transitions, 437 flow [2023-01-27 18:12:59,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 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-27 18:12:59,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:12:59,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:12:59,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:12:59,940 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-27 18:12:59,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:12:59,941 INFO L85 PathProgramCache]: Analyzing trace with hash 445096629, now seen corresponding path program 1 times [2023-01-27 18:12:59,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:12:59,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255355644] [2023-01-27 18:12:59,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:12:59,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:12:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:00,124 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-27 18:13:00,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:00,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255355644] [2023-01-27 18:13:00,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255355644] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:00,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:00,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:13:00,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132579026] [2023-01-27 18:13:00,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:00,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:13:00,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:00,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:13:00,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:13:00,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 242 [2023-01-27 18:13:00,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 61 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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-27 18:13:00,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:00,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 242 [2023-01-27 18:13:00,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:02,090 INFO L130 PetriNetUnfolder]: 15130/22137 cut-off events. [2023-01-27 18:13:02,091 INFO L131 PetriNetUnfolder]: For 51443/52031 co-relation queries the response was YES. [2023-01-27 18:13:02,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79811 conditions, 22137 events. 15130/22137 cut-off events. For 51443/52031 co-relation queries the response was YES. Maximal size of possible extension queue 954. Compared 141494 event pairs, 7189 based on Foata normal form. 517/22365 useless extension candidates. Maximal degree in co-relation 79785. Up to 11385 conditions per place. [2023-01-27 18:13:02,215 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 70 selfloop transitions, 7 changer transitions 10/94 dead transitions. [2023-01-27 18:13:02,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 94 transitions, 781 flow [2023-01-27 18:13:02,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:13:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:13:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-01-27 18:13:02,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5330578512396694 [2023-01-27 18:13:02,217 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-01-27 18:13:02,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-01-27 18:13:02,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:02,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-01-27 18:13:02,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 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-27 18:13:02,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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-27 18:13:02,219 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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-27 18:13:02,219 INFO L175 Difference]: Start difference. First operand has 59 places, 61 transitions, 437 flow. Second operand 3 states and 387 transitions. [2023-01-27 18:13:02,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 94 transitions, 781 flow [2023-01-27 18:13:02,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 94 transitions, 772 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:13:02,285 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 423 flow [2023-01-27 18:13:02,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=423, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2023-01-27 18:13:02,285 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2023-01-27 18:13:02,286 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 423 flow [2023-01-27 18:13:02,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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-27 18:13:02,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:02,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:02,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:13:02,286 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-27 18:13:02,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:02,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1580943534, now seen corresponding path program 1 times [2023-01-27 18:13:02,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:02,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970244277] [2023-01-27 18:13:02,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:02,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:02,443 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-27 18:13:02,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:02,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970244277] [2023-01-27 18:13:02,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970244277] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:02,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:02,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:13:02,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395550881] [2023-01-27 18:13:02,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:02,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:13:02,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:02,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:13:02,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:13:02,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-01-27 18:13:02,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 423 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 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-27 18:13:02,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:02,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-01-27 18:13:02,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:03,843 INFO L130 PetriNetUnfolder]: 10251/15512 cut-off events. [2023-01-27 18:13:03,843 INFO L131 PetriNetUnfolder]: For 35498/36468 co-relation queries the response was YES. [2023-01-27 18:13:03,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54862 conditions, 15512 events. 10251/15512 cut-off events. For 35498/36468 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 103015 event pairs, 1114 based on Foata normal form. 1398/16646 useless extension candidates. Maximal degree in co-relation 54835. Up to 5067 conditions per place. [2023-01-27 18:13:03,896 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 153 selfloop transitions, 17 changer transitions 1/182 dead transitions. [2023-01-27 18:13:03,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 182 transitions, 1639 flow [2023-01-27 18:13:03,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:13:03,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:13:03,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 856 transitions. [2023-01-27 18:13:03,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053128689492326 [2023-01-27 18:13:03,899 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 856 transitions. [2023-01-27 18:13:03,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 856 transitions. [2023-01-27 18:13:03,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:03,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 856 transitions. [2023-01-27 18:13:03,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:03,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 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-27 18:13:03,903 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 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-27 18:13:03,903 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 423 flow. Second operand 7 states and 856 transitions. [2023-01-27 18:13:03,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 182 transitions, 1639 flow [2023-01-27 18:13:03,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 182 transitions, 1547 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-01-27 18:13:03,969 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 525 flow [2023-01-27 18:13:03,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=525, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2023-01-27 18:13:03,970 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2023-01-27 18:13:03,970 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 525 flow [2023-01-27 18:13:03,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 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-27 18:13:03,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:03,971 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-27 18:13:03,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:13:03,971 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-27 18:13:03,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:03,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1557230208, now seen corresponding path program 1 times [2023-01-27 18:13:03,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:03,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074884523] [2023-01-27 18:13:03,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:03,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:04,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-27 18:13:04,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:04,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074884523] [2023-01-27 18:13:04,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074884523] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:04,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:04,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:13:04,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773868812] [2023-01-27 18:13:04,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:04,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:13:04,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:04,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:13:04,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:13:04,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-01-27 18:13:04,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 525 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 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-27 18:13:04,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:04,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-01-27 18:13:04,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:05,346 INFO L130 PetriNetUnfolder]: 9591/14484 cut-off events. [2023-01-27 18:13:05,346 INFO L131 PetriNetUnfolder]: For 35839/36785 co-relation queries the response was YES. [2023-01-27 18:13:05,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58516 conditions, 14484 events. 9591/14484 cut-off events. For 35839/36785 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 95640 event pairs, 941 based on Foata normal form. 718/14928 useless extension candidates. Maximal degree in co-relation 58486. Up to 4825 conditions per place. [2023-01-27 18:13:05,429 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 169 selfloop transitions, 26 changer transitions 15/221 dead transitions. [2023-01-27 18:13:05,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 221 transitions, 1969 flow [2023-01-27 18:13:05,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:13:05,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:13:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1101 transitions. [2023-01-27 18:13:05,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5055096418732782 [2023-01-27 18:13:05,432 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1101 transitions. [2023-01-27 18:13:05,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1101 transitions. [2023-01-27 18:13:05,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:05,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1101 transitions. [2023-01-27 18:13:05,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.33333333333333) internal successors, (1101), 9 states have internal predecessors, (1101), 0 states have call successors, (0), 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-27 18:13:05,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 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-27 18:13:05,438 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 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-27 18:13:05,438 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 525 flow. Second operand 9 states and 1101 transitions. [2023-01-27 18:13:05,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 221 transitions, 1969 flow [2023-01-27 18:13:06,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 221 transitions, 1921 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-01-27 18:13:06,421 INFO L231 Difference]: Finished difference. Result has 76 places, 75 transitions, 651 flow [2023-01-27 18:13:06,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=651, PETRI_PLACES=76, PETRI_TRANSITIONS=75} [2023-01-27 18:13:06,421 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2023-01-27 18:13:06,421 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 651 flow [2023-01-27 18:13:06,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 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-27 18:13:06,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:06,422 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] [2023-01-27 18:13:06,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:13:06,422 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-27 18:13:06,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:06,422 INFO L85 PathProgramCache]: Analyzing trace with hash -630083128, now seen corresponding path program 1 times [2023-01-27 18:13:06,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:06,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671090650] [2023-01-27 18:13:06,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:06,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:07,499 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-27 18:13:07,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:07,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671090650] [2023-01-27 18:13:07,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671090650] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:07,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:07,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-27 18:13:07,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380354169] [2023-01-27 18:13:07,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:07,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-27 18:13:07,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:07,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-27 18:13:07,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-01-27 18:13:07,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 242 [2023-01-27 18:13:07,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 651 flow. Second operand has 9 states, 9 states have (on average 95.66666666666667) internal successors, (861), 9 states have internal predecessors, (861), 0 states have call successors, (0), 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-27 18:13:07,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:07,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 242 [2023-01-27 18:13:07,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:10,037 INFO L130 PetriNetUnfolder]: 19150/28644 cut-off events. [2023-01-27 18:13:10,037 INFO L131 PetriNetUnfolder]: For 119381/119381 co-relation queries the response was YES. [2023-01-27 18:13:10,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126987 conditions, 28644 events. 19150/28644 cut-off events. For 119381/119381 co-relation queries the response was YES. Maximal size of possible extension queue 1162. Compared 193633 event pairs, 1673 based on Foata normal form. 11/28655 useless extension candidates. Maximal degree in co-relation 126954. Up to 6681 conditions per place. [2023-01-27 18:13:10,184 INFO L137 encePairwiseOnDemand]: 230/242 looper letters, 219 selfloop transitions, 65 changer transitions 136/420 dead transitions. [2023-01-27 18:13:10,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 420 transitions, 4438 flow [2023-01-27 18:13:10,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-27 18:13:10,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-27 18:13:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1216 transitions. [2023-01-27 18:13:10,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4567993989481593 [2023-01-27 18:13:10,191 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1216 transitions. [2023-01-27 18:13:10,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1216 transitions. [2023-01-27 18:13:10,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:10,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1216 transitions. [2023-01-27 18:13:10,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 110.54545454545455) internal successors, (1216), 11 states have internal predecessors, (1216), 0 states have call successors, (0), 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-27 18:13:10,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 242.0) internal successors, (2904), 12 states have internal predecessors, (2904), 0 states have call successors, (0), 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-27 18:13:10,197 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 242.0) internal successors, (2904), 12 states have internal predecessors, (2904), 0 states have call successors, (0), 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-27 18:13:10,197 INFO L175 Difference]: Start difference. First operand has 76 places, 75 transitions, 651 flow. Second operand 11 states and 1216 transitions. [2023-01-27 18:13:10,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 420 transitions, 4438 flow [2023-01-27 18:13:12,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 420 transitions, 3689 flow, removed 274 selfloop flow, removed 4 redundant places. [2023-01-27 18:13:12,783 INFO L231 Difference]: Finished difference. Result has 86 places, 108 transitions, 1123 flow [2023-01-27 18:13:12,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1123, PETRI_PLACES=86, PETRI_TRANSITIONS=108} [2023-01-27 18:13:12,783 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2023-01-27 18:13:12,783 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 108 transitions, 1123 flow [2023-01-27 18:13:12,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 95.66666666666667) internal successors, (861), 9 states have internal predecessors, (861), 0 states have call successors, (0), 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-27 18:13:12,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:12,784 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] [2023-01-27 18:13:12,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:13:12,784 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-27 18:13:12,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:12,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1332257646, now seen corresponding path program 2 times [2023-01-27 18:13:12,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:12,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851581306] [2023-01-27 18:13:12,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:12,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:13,208 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-27 18:13:13,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:13,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851581306] [2023-01-27 18:13:13,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851581306] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:13,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:13,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:13:13,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667196669] [2023-01-27 18:13:13,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:13,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:13:13,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:13,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:13:13,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:13:13,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 242 [2023-01-27 18:13:13,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 108 transitions, 1123 flow. Second operand has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 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-27 18:13:13,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:13,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 242 [2023-01-27 18:13:13,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:14,488 INFO L130 PetriNetUnfolder]: 8567/13992 cut-off events. [2023-01-27 18:13:14,488 INFO L131 PetriNetUnfolder]: For 48472/48932 co-relation queries the response was YES. [2023-01-27 18:13:14,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59905 conditions, 13992 events. 8567/13992 cut-off events. For 48472/48932 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 99206 event pairs, 2362 based on Foata normal form. 302/14174 useless extension candidates. Maximal degree in co-relation 59867. Up to 8081 conditions per place. [2023-01-27 18:13:14,560 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 139 selfloop transitions, 13 changer transitions 54/227 dead transitions. [2023-01-27 18:13:14,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 227 transitions, 2369 flow [2023-01-27 18:13:14,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:13:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:13:14,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 852 transitions. [2023-01-27 18:13:14,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5029515938606848 [2023-01-27 18:13:14,562 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 852 transitions. [2023-01-27 18:13:14,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 852 transitions. [2023-01-27 18:13:14,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:14,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 852 transitions. [2023-01-27 18:13:14,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 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-27 18:13:14,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 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-27 18:13:14,566 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 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-27 18:13:14,566 INFO L175 Difference]: Start difference. First operand has 86 places, 108 transitions, 1123 flow. Second operand 7 states and 852 transitions. [2023-01-27 18:13:14,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 227 transitions, 2369 flow [2023-01-27 18:13:14,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 227 transitions, 2267 flow, removed 45 selfloop flow, removed 6 redundant places. [2023-01-27 18:13:14,942 INFO L231 Difference]: Finished difference. Result has 84 places, 116 transitions, 1177 flow [2023-01-27 18:13:14,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1177, PETRI_PLACES=84, PETRI_TRANSITIONS=116} [2023-01-27 18:13:14,942 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 41 predicate places. [2023-01-27 18:13:14,942 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 116 transitions, 1177 flow [2023-01-27 18:13:14,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 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-27 18:13:14,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:14,943 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] [2023-01-27 18:13:14,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:13:14,943 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-27 18:13:14,943 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:14,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1881503038, now seen corresponding path program 3 times [2023-01-27 18:13:14,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:14,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033087233] [2023-01-27 18:13:14,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:14,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:15,150 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-27 18:13:15,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:15,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033087233] [2023-01-27 18:13:15,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033087233] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:15,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:15,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:13:15,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823563230] [2023-01-27 18:13:15,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:15,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:13:15,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:15,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:13:15,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:13:15,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-01-27 18:13:15,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 116 transitions, 1177 flow. Second operand has 7 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 0 states have call successors, (0), 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-27 18:13:15,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:15,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-01-27 18:13:15,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:16,080 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~b$w_buff0_used~0_101 256) 0))) (.cse3 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_18 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_102 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_95 256))))) (.cse4 (and .cse2 .cse5))) (and (= v_~b~0_50 (ite .cse0 v_~b$w_buff0~0_34 (ite .cse1 v_~b$w_buff1~0_31 v_~b~0_51))) (= (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_17 256) 0))) (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_94 256))))) 0 v_~b$r_buff1_thd2~0_16) v_~b$r_buff1_thd2~0_15) (= (ite .cse0 0 v_~b$w_buff0_used~0_102) v_~b$w_buff0_used~0_101) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_18) v_~b$r_buff0_thd2~0_17) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_95) v_~b$w_buff1_used~0_94)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_102, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_95, ~b~0=v_~b~0_51, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_94, ~b~0=v_~b~0_50, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][89], [Black: 246#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= ~b$w_buff0~0 1)), Black: 252#(and (= ~b$r_buff0_thd4~0 0) (not (= ~__unbuffered_p3_EBX~0 0))), 111#L793true, 30#L876-3true, 164#true, 104#P0EXITtrue, 102#L852true, Black: 200#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 225#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), 156#true, Black: 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 245#(= ~b$r_buff0_thd4~0 0), Black: 209#(<= ~__unbuffered_cnt~0 2), 261#(<= ~__unbuffered_cnt~0 1), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~z~0 0), Black: 167#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 235#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), Black: 174#(= ~__unbuffered_p3_EAX~0 0), 115#L813true, Black: 224#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 233#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 195#(<= ~__unbuffered_cnt~0 1), Black: 179#(= ~__unbuffered_cnt~0 0), Black: 247#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 250#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 189#(= ~x~0 1)]) [2023-01-27 18:13:16,080 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-01-27 18:13:16,080 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:13:16,080 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:13:16,081 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:13:16,087 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~b$w_buff0_used~0_101 256) 0))) (.cse3 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_18 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_102 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_95 256))))) (.cse4 (and .cse2 .cse5))) (and (= v_~b~0_50 (ite .cse0 v_~b$w_buff0~0_34 (ite .cse1 v_~b$w_buff1~0_31 v_~b~0_51))) (= (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_17 256) 0))) (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_94 256))))) 0 v_~b$r_buff1_thd2~0_16) v_~b$r_buff1_thd2~0_15) (= (ite .cse0 0 v_~b$w_buff0_used~0_102) v_~b$w_buff0_used~0_101) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_18) v_~b$r_buff0_thd2~0_17) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_95) v_~b$w_buff1_used~0_94)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_102, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_95, ~b~0=v_~b~0_51, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_94, ~b~0=v_~b~0_50, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][89], [Black: 246#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= ~b$w_buff0~0 1)), Black: 252#(and (= ~b$r_buff0_thd4~0 0) (not (= ~__unbuffered_p3_EBX~0 0))), 111#L793true, 30#L876-3true, 164#true, Black: 200#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 84#P3EXITtrue, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 225#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), 156#true, Black: 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 245#(= ~b$r_buff0_thd4~0 0), Black: 209#(<= ~__unbuffered_cnt~0 2), 261#(<= ~__unbuffered_cnt~0 1), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~z~0 0), Black: 167#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 235#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), Black: 174#(= ~__unbuffered_p3_EAX~0 0), 115#L813true, Black: 224#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 233#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 25#L773true, 195#(<= ~__unbuffered_cnt~0 1), Black: 179#(= ~__unbuffered_cnt~0 0), Black: 247#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 250#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 189#(= ~x~0 1)]) [2023-01-27 18:13:16,087 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-01-27 18:13:16,087 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:13:16,087 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:13:16,087 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:13:16,151 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~b$w_buff0_used~0_101 256) 0))) (.cse3 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_18 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_102 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_95 256))))) (.cse4 (and .cse2 .cse5))) (and (= v_~b~0_50 (ite .cse0 v_~b$w_buff0~0_34 (ite .cse1 v_~b$w_buff1~0_31 v_~b~0_51))) (= (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_17 256) 0))) (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_94 256))))) 0 v_~b$r_buff1_thd2~0_16) v_~b$r_buff1_thd2~0_15) (= (ite .cse0 0 v_~b$w_buff0_used~0_102) v_~b$w_buff0_used~0_101) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_18) v_~b$r_buff0_thd2~0_17) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_95) v_~b$w_buff1_used~0_94)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_102, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_95, ~b~0=v_~b~0_51, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_94, ~b~0=v_~b~0_50, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][159], [Black: 246#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= ~b$w_buff0~0 1)), Black: 252#(and (= ~b$r_buff0_thd4~0 0) (not (= ~__unbuffered_p3_EBX~0 0))), 30#L876-3true, 111#L793true, 262#(<= ~__unbuffered_cnt~0 2), 164#true, 104#P0EXITtrue, 102#L852true, Black: 200#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 195#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork2InUse, 209#(<= ~__unbuffered_cnt~0 2), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 225#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), 156#true, Black: 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 245#(= ~b$r_buff0_thd4~0 0), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~z~0 0), Black: 167#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 235#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 224#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 233#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 179#(= ~__unbuffered_cnt~0 0), 64#P2EXITtrue, Black: 247#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 250#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 189#(= ~x~0 1)]) [2023-01-27 18:13:16,151 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-01-27 18:13:16,151 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-27 18:13:16,151 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-27 18:13:16,151 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-27 18:13:16,152 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~b$w_buff0_used~0_101 256) 0))) (.cse3 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_18 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_102 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_95 256))))) (.cse4 (and .cse2 .cse5))) (and (= v_~b~0_50 (ite .cse0 v_~b$w_buff0~0_34 (ite .cse1 v_~b$w_buff1~0_31 v_~b~0_51))) (= (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_17 256) 0))) (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_94 256))))) 0 v_~b$r_buff1_thd2~0_16) v_~b$r_buff1_thd2~0_15) (= (ite .cse0 0 v_~b$w_buff0_used~0_102) v_~b$w_buff0_used~0_101) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_18) v_~b$r_buff0_thd2~0_17) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_95) v_~b$w_buff1_used~0_94)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_102, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_95, ~b~0=v_~b~0_51, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_94, ~b~0=v_~b~0_50, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][159], [Black: 246#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= ~b$w_buff0~0 1)), Black: 252#(and (= ~b$r_buff0_thd4~0 0) (not (= ~__unbuffered_p3_EBX~0 0))), 111#L793true, 30#L876-3true, 262#(<= ~__unbuffered_cnt~0 2), 164#true, 104#P0EXITtrue, Black: 200#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 84#P3EXITtrue, P2Thread1of1ForFork0InUse, Black: 195#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork2InUse, 209#(<= ~__unbuffered_cnt~0 2), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 225#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), 156#true, Black: 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 245#(= ~b$r_buff0_thd4~0 0), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~z~0 0), Black: 167#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 235#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), Black: 174#(= ~__unbuffered_p3_EAX~0 0), 115#L813true, Black: 224#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 233#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 179#(= ~__unbuffered_cnt~0 0), Black: 247#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 250#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 189#(= ~x~0 1)]) [2023-01-27 18:13:16,152 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-01-27 18:13:16,152 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-27 18:13:16,152 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-27 18:13:16,152 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-27 18:13:16,156 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~b$w_buff0_used~0_101 256) 0))) (.cse3 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_18 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_102 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_95 256))))) (.cse4 (and .cse2 .cse5))) (and (= v_~b~0_50 (ite .cse0 v_~b$w_buff0~0_34 (ite .cse1 v_~b$w_buff1~0_31 v_~b~0_51))) (= (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_17 256) 0))) (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_94 256))))) 0 v_~b$r_buff1_thd2~0_16) v_~b$r_buff1_thd2~0_15) (= (ite .cse0 0 v_~b$w_buff0_used~0_102) v_~b$w_buff0_used~0_101) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_18) v_~b$r_buff0_thd2~0_17) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_95) v_~b$w_buff1_used~0_94)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_102, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_95, ~b~0=v_~b~0_51, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_94, ~b~0=v_~b~0_50, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][159], [Black: 246#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= ~b$w_buff0~0 1)), Black: 252#(and (= ~b$r_buff0_thd4~0 0) (not (= ~__unbuffered_p3_EBX~0 0))), 30#L876-3true, 111#L793true, 262#(<= ~__unbuffered_cnt~0 2), 164#true, Black: 200#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 84#P3EXITtrue, P2Thread1of1ForFork0InUse, Black: 195#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork2InUse, 209#(<= ~__unbuffered_cnt~0 2), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 225#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), 156#true, Black: 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 245#(= ~b$r_buff0_thd4~0 0), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~z~0 0), Black: 167#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 235#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 224#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 233#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 25#L773true, Black: 179#(= ~__unbuffered_cnt~0 0), 64#P2EXITtrue, Black: 247#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 250#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 189#(= ~x~0 1)]) [2023-01-27 18:13:16,156 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-01-27 18:13:16,156 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-27 18:13:16,156 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-27 18:13:16,156 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-27 18:13:16,215 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~b$w_buff0_used~0_101 256) 0))) (.cse3 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_18 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_102 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_95 256))))) (.cse4 (and .cse2 .cse5))) (and (= v_~b~0_50 (ite .cse0 v_~b$w_buff0~0_34 (ite .cse1 v_~b$w_buff1~0_31 v_~b~0_51))) (= (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_17 256) 0))) (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_94 256))))) 0 v_~b$r_buff1_thd2~0_16) v_~b$r_buff1_thd2~0_15) (= (ite .cse0 0 v_~b$w_buff0_used~0_102) v_~b$w_buff0_used~0_101) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_18) v_~b$r_buff0_thd2~0_17) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_95) v_~b$w_buff1_used~0_94)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_102, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_95, ~b~0=v_~b~0_51, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_94, ~b~0=v_~b~0_50, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][249], [Black: 246#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= ~b$w_buff0~0 1)), Black: 252#(and (= ~b$r_buff0_thd4~0 0) (not (= ~__unbuffered_p3_EBX~0 0))), 30#L876-3true, 111#L793true, 164#true, 104#P0EXITtrue, Black: 200#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P2Thread1of1ForFork0InUse, 84#P3EXITtrue, Black: 195#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork2InUse, 263#(<= ~__unbuffered_cnt~0 3), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 225#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), 156#true, Black: 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 245#(= ~b$r_buff0_thd4~0 0), Black: 209#(<= ~__unbuffered_cnt~0 2), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~z~0 0), 205#true, Black: 167#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 235#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), Black: 224#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 233#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 179#(= ~__unbuffered_cnt~0 0), 64#P2EXITtrue, Black: 247#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 250#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 189#(= ~x~0 1)]) [2023-01-27 18:13:16,215 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-01-27 18:13:16,215 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-01-27 18:13:16,215 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-01-27 18:13:16,215 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-01-27 18:13:16,249 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~b$w_buff0_used~0_101 256) 0))) (.cse3 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_18 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_102 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_95 256))))) (.cse4 (and .cse2 .cse5))) (and (= v_~b~0_50 (ite .cse0 v_~b$w_buff0~0_34 (ite .cse1 v_~b$w_buff1~0_31 v_~b~0_51))) (= (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_17 256) 0))) (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_94 256))))) 0 v_~b$r_buff1_thd2~0_16) v_~b$r_buff1_thd2~0_15) (= (ite .cse0 0 v_~b$w_buff0_used~0_102) v_~b$w_buff0_used~0_101) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_18) v_~b$r_buff0_thd2~0_17) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_95) v_~b$w_buff1_used~0_94)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_102, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_95, ~b~0=v_~b~0_51, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_94, ~b~0=v_~b~0_50, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][271], [Black: 246#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= ~b$w_buff0~0 1)), Black: 252#(and (= ~b$r_buff0_thd4~0 0) (not (= ~__unbuffered_p3_EBX~0 0))), 111#L793true, 164#true, 104#P0EXITtrue, Black: 200#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P2Thread1of1ForFork0InUse, 84#P3EXITtrue, Black: 195#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 225#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), 156#true, Black: 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 245#(= ~b$r_buff0_thd4~0 0), 58#L3true, Black: 209#(<= ~__unbuffered_cnt~0 2), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~z~0 0), 205#true, Black: 167#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 266#(and (<= ~__unbuffered_cnt~0 3) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 235#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), Black: 224#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 233#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 179#(= ~__unbuffered_cnt~0 0), 64#P2EXITtrue, Black: 247#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 250#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 189#(= ~x~0 1)]) [2023-01-27 18:13:16,249 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-01-27 18:13:16,249 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-01-27 18:13:16,249 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-01-27 18:13:16,249 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-01-27 18:13:16,286 INFO L130 PetriNetUnfolder]: 7195/11475 cut-off events. [2023-01-27 18:13:16,286 INFO L131 PetriNetUnfolder]: For 45487/46130 co-relation queries the response was YES. [2023-01-27 18:13:16,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51765 conditions, 11475 events. 7195/11475 cut-off events. For 45487/46130 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 79271 event pairs, 766 based on Foata normal form. 566/11883 useless extension candidates. Maximal degree in co-relation 51727. Up to 4544 conditions per place. [2023-01-27 18:13:16,341 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 181 selfloop transitions, 18 changer transitions 84/299 dead transitions. [2023-01-27 18:13:16,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 299 transitions, 3527 flow [2023-01-27 18:13:16,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:13:16,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:13:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 952 transitions. [2023-01-27 18:13:16,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49173553719008267 [2023-01-27 18:13:16,343 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 952 transitions. [2023-01-27 18:13:16,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 952 transitions. [2023-01-27 18:13:16,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:16,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 952 transitions. [2023-01-27 18:13:16,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 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-27 18:13:16,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 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-27 18:13:16,347 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 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-27 18:13:16,347 INFO L175 Difference]: Start difference. First operand has 84 places, 116 transitions, 1177 flow. Second operand 8 states and 952 transitions. [2023-01-27 18:13:16,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 299 transitions, 3527 flow [2023-01-27 18:13:16,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 299 transitions, 3441 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-01-27 18:13:16,878 INFO L231 Difference]: Finished difference. Result has 88 places, 99 transitions, 992 flow [2023-01-27 18:13:16,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=992, PETRI_PLACES=88, PETRI_TRANSITIONS=99} [2023-01-27 18:13:16,878 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 45 predicate places. [2023-01-27 18:13:16,878 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 99 transitions, 992 flow [2023-01-27 18:13:16,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 0 states have call successors, (0), 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-27 18:13:16,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:16,879 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] [2023-01-27 18:13:16,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:13:16,879 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-27 18:13:16,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:16,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1350237375, now seen corresponding path program 1 times [2023-01-27 18:13:16,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:16,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740429015] [2023-01-27 18:13:16,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:16,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:17,179 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-27 18:13:17,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:17,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740429015] [2023-01-27 18:13:17,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740429015] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:17,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:17,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:13:17,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225914471] [2023-01-27 18:13:17,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:17,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:13:17,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:17,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:13:17,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:13:17,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 242 [2023-01-27 18:13:17,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 99 transitions, 992 flow. Second operand has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 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-27 18:13:17,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:17,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 242 [2023-01-27 18:13:17,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:17,942 INFO L130 PetriNetUnfolder]: 4153/6418 cut-off events. [2023-01-27 18:13:17,942 INFO L131 PetriNetUnfolder]: For 30945/30945 co-relation queries the response was YES. [2023-01-27 18:13:17,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31851 conditions, 6418 events. 4153/6418 cut-off events. For 30945/30945 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 35389 event pairs, 400 based on Foata normal form. 2/6420 useless extension candidates. Maximal degree in co-relation 31812. Up to 3107 conditions per place. [2023-01-27 18:13:17,969 INFO L137 encePairwiseOnDemand]: 228/242 looper letters, 122 selfloop transitions, 98 changer transitions 97/317 dead transitions. [2023-01-27 18:13:17,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 317 transitions, 3435 flow [2023-01-27 18:13:17,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-27 18:13:17,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-01-27 18:13:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1662 transitions. [2023-01-27 18:13:17,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4578512396694215 [2023-01-27 18:13:17,972 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1662 transitions. [2023-01-27 18:13:17,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1662 transitions. [2023-01-27 18:13:17,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:17,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1662 transitions. [2023-01-27 18:13:17,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 110.8) internal successors, (1662), 15 states have internal predecessors, (1662), 0 states have call successors, (0), 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-27 18:13:17,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 242.0) internal successors, (3872), 16 states have internal predecessors, (3872), 0 states have call successors, (0), 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-27 18:13:17,981 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 242.0) internal successors, (3872), 16 states have internal predecessors, (3872), 0 states have call successors, (0), 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-27 18:13:17,981 INFO L175 Difference]: Start difference. First operand has 88 places, 99 transitions, 992 flow. Second operand 15 states and 1662 transitions. [2023-01-27 18:13:17,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 317 transitions, 3435 flow [2023-01-27 18:13:18,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 317 transitions, 3221 flow, removed 44 selfloop flow, removed 9 redundant places. [2023-01-27 18:13:18,067 INFO L231 Difference]: Finished difference. Result has 100 places, 153 transitions, 1804 flow [2023-01-27 18:13:18,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1804, PETRI_PLACES=100, PETRI_TRANSITIONS=153} [2023-01-27 18:13:18,067 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2023-01-27 18:13:18,068 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 153 transitions, 1804 flow [2023-01-27 18:13:18,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 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-27 18:13:18,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:18,068 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] [2023-01-27 18:13:18,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:13:18,068 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-27 18:13:18,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:18,068 INFO L85 PathProgramCache]: Analyzing trace with hash 235005003, now seen corresponding path program 2 times [2023-01-27 18:13:18,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:18,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512512704] [2023-01-27 18:13:18,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:18,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:18,233 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-27 18:13:18,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:18,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512512704] [2023-01-27 18:13:18,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512512704] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:18,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:18,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:13:18,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486024213] [2023-01-27 18:13:18,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:18,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:13:18,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:18,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:13:18,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:13:18,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-01-27 18:13:18,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 153 transitions, 1804 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 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-27 18:13:18,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:18,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-01-27 18:13:18,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:18,804 INFO L130 PetriNetUnfolder]: 3558/5708 cut-off events. [2023-01-27 18:13:18,804 INFO L131 PetriNetUnfolder]: For 29417/29417 co-relation queries the response was YES. [2023-01-27 18:13:18,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27955 conditions, 5708 events. 3558/5708 cut-off events. For 29417/29417 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 33061 event pairs, 1027 based on Foata normal form. 2/5710 useless extension candidates. Maximal degree in co-relation 27913. Up to 3006 conditions per place. [2023-01-27 18:13:18,828 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 120 selfloop transitions, 37 changer transitions 89/246 dead transitions. [2023-01-27 18:13:18,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 246 transitions, 3173 flow [2023-01-27 18:13:18,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:13:18,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:13:18,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2023-01-27 18:13:18,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020661157024794 [2023-01-27 18:13:18,830 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 486 transitions. [2023-01-27 18:13:18,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 486 transitions. [2023-01-27 18:13:18,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:18,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 486 transitions. [2023-01-27 18:13:18,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 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-27 18:13:18,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 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-27 18:13:18,832 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 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-27 18:13:18,832 INFO L175 Difference]: Start difference. First operand has 100 places, 153 transitions, 1804 flow. Second operand 4 states and 486 transitions. [2023-01-27 18:13:18,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 246 transitions, 3173 flow [2023-01-27 18:13:18,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 246 transitions, 3111 flow, removed 31 selfloop flow, removed 2 redundant places. [2023-01-27 18:13:18,943 INFO L231 Difference]: Finished difference. Result has 100 places, 120 transitions, 1407 flow [2023-01-27 18:13:18,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1768, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1407, PETRI_PLACES=100, PETRI_TRANSITIONS=120} [2023-01-27 18:13:18,943 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2023-01-27 18:13:18,943 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 120 transitions, 1407 flow [2023-01-27 18:13:18,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 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-27 18:13:18,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:18,944 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] [2023-01-27 18:13:18,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-27 18:13:18,944 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:13:18,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:18,944 INFO L85 PathProgramCache]: Analyzing trace with hash -435288539, now seen corresponding path program 3 times [2023-01-27 18:13:18,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:18,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782928366] [2023-01-27 18:13:18,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:18,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:13:18,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:13:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:13:19,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:13:19,058 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:13:19,059 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-27 18:13:19,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-27 18:13:19,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-27 18:13:19,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-27 18:13:19,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-27 18:13:19,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-27 18:13:19,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-27 18:13:19,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-27 18:13:19,062 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:19,066 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:13:19,066 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:13:19,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:13:19 BasicIcfg [2023-01-27 18:13:19,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:13:19,128 INFO L158 Benchmark]: Toolchain (without parser) took 33128.42ms. Allocated memory was 402.7MB in the beginning and 3.8GB in the end (delta: 3.4GB). Free memory was 369.5MB in the beginning and 1.1GB in the end (delta: -759.6MB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. [2023-01-27 18:13:19,129 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:13:19,129 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.80ms. Allocated memory is still 402.7MB. Free memory was 369.5MB in the beginning and 345.5MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-27 18:13:19,129 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.36ms. Allocated memory is still 402.7MB. Free memory was 345.5MB in the beginning and 343.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:13:19,129 INFO L158 Benchmark]: Boogie Preprocessor took 42.57ms. Allocated memory is still 402.7MB. Free memory was 343.1MB in the beginning and 341.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:13:19,129 INFO L158 Benchmark]: RCFGBuilder took 513.36ms. Allocated memory is still 402.7MB. Free memory was 341.0MB in the beginning and 301.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-01-27 18:13:19,129 INFO L158 Benchmark]: TraceAbstraction took 32142.35ms. Allocated memory was 402.7MB in the beginning and 3.8GB in the end (delta: 3.4GB). Free memory was 300.8MB in the beginning and 1.1GB in the end (delta: -828.3MB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. [2023-01-27 18:13:19,130 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.11ms. Allocated memory is still 255.9MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 367.80ms. Allocated memory is still 402.7MB. Free memory was 369.5MB in the beginning and 345.5MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 58.36ms. Allocated memory is still 402.7MB. Free memory was 345.5MB in the beginning and 343.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 42.57ms. Allocated memory is still 402.7MB. Free memory was 343.1MB in the beginning and 341.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 513.36ms. Allocated memory is still 402.7MB. Free memory was 341.0MB in the beginning and 301.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 32142.35ms. Allocated memory was 402.7MB in the beginning and 3.8GB in the end (delta: 3.4GB). Free memory was 300.8MB in the beginning and 1.1GB in the end (delta: -828.3MB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 139 PlacesBefore, 43 PlacesAfterwards, 128 TransitionsBefore, 31 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 8670 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3437, independent: 3217, independent conditional: 0, independent unconditional: 3217, dependent: 220, dependent conditional: 0, dependent unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1767, independent: 1720, independent conditional: 0, independent unconditional: 1720, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3437, independent: 1497, independent conditional: 0, independent unconditional: 1497, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 1767, unknown conditional: 0, unknown unconditional: 1767] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 150, Positive conditional cache size: 0, Positive unconditional cache size: 150, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$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 t1161; [L870] FCALL, FORK 0 pthread_create(&t1161, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1161, ((void *)0), P0, ((void *)0))=-3, t1161={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1162; [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L872] FCALL, FORK 0 pthread_create(&t1162, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1162, ((void *)0), P1, ((void *)0))=-2, t1161={5:0}, t1162={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L873] 0 pthread_t t1163; [L874] FCALL, FORK 0 pthread_create(&t1163, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1163, ((void *)0), P2, ((void *)0))=-1, t1161={5:0}, t1162={6:0}, t1163={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L875] 0 pthread_t t1164; [L876] FCALL, FORK 0 pthread_create(&t1164, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1164, ((void *)0), P3, ((void *)0))=0, t1161={5:0}, t1162={6:0}, t1163={7:0}, t1164={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L802] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L805] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L822] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 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 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L884] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L886] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1161={5:0}, t1162={6:0}, t1163={7:0}, t1164={3:0}, weak$$choice2=1, x=2, y=1, z=2] [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 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_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 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: 32.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 24.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 711 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 711 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2055 IncrementalHoareTripleChecker+Invalid, 2159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 32 mSDtfsCounter, 2055 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1804occurred in iteration=13, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 275 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 1907 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-27 18:13:19,149 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...