/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix026.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:39:30,221 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:39:30,222 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:39:30,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:39:30,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:39:30,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:39:30,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:39:30,248 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:39:30,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:39:30,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:39:30,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:39:30,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:39:30,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:39:30,257 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:39:30,258 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:39:30,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:39:30,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:39:30,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:39:30,261 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:39:30,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:39:30,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:39:30,266 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:39:30,267 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:39:30,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:39:30,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:39:30,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:39:30,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:39:30,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:39:30,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:39:30,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:39:30,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:39:30,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:39:30,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:39:30,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:39:30,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:39:30,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:39:30,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:39:30,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:39:30,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:39:30,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:39:30,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:39:30,280 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 00:39:30,304 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:39:30,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:39:30,305 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:39:30,305 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:39:30,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:39:30,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:39:30,306 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:39:30,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:39:30,306 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:39:30,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:39:30,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:39:30,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:39:30,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:39:30,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:39:30,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:39:30,307 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:39:30,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:39:30,307 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:39:30,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:39:30,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:39:30,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:39:30,308 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:39:30,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:39:30,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:39:30,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:39:30,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:39:30,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:39:30,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:39:30,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:39:30,309 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:39:30,309 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:39:30,309 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:39:30,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:39:30,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:39:30,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:39:30,509 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:39:30,509 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:39:30,510 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026.oepc.i [2023-01-28 00:39:31,399 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:39:31,619 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:39:31,619 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026.oepc.i [2023-01-28 00:39:31,635 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83a498ed2/01233c8dd0df405ba501c0b80b000c20/FLAG7de7555e5 [2023-01-28 00:39:31,647 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83a498ed2/01233c8dd0df405ba501c0b80b000c20 [2023-01-28 00:39:31,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:39:31,649 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:39:31,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:39:31,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:39:31,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:39:31,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:39:31" (1/1) ... [2023-01-28 00:39:31,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cdc7ec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:31, skipping insertion in model container [2023-01-28 00:39:31,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:39:31" (1/1) ... [2023-01-28 00:39:31,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:39:31,699 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:39:31,800 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/mix026.oepc.i[945,958] [2023-01-28 00:39:31,979 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:39:31,989 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:39:31,999 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/mix026.oepc.i[945,958] [2023-01-28 00:39:32,056 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:39:32,082 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:39:32,082 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:39:32,087 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:39:32,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:32 WrapperNode [2023-01-28 00:39:32,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:39:32,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:39:32,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:39:32,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:39:32,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:32" (1/1) ... [2023-01-28 00:39:32,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:32" (1/1) ... [2023-01-28 00:39:32,139 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-01-28 00:39:32,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:39:32,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:39:32,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:39:32,140 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:39:32,149 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:32" (1/1) ... [2023-01-28 00:39:32,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:32" (1/1) ... [2023-01-28 00:39:32,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:32" (1/1) ... [2023-01-28 00:39:32,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:32" (1/1) ... [2023-01-28 00:39:32,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:32" (1/1) ... [2023-01-28 00:39:32,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:32" (1/1) ... [2023-01-28 00:39:32,166 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:32" (1/1) ... [2023-01-28 00:39:32,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:32" (1/1) ... [2023-01-28 00:39:32,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:39:32,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:39:32,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:39:32,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:39:32,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:32" (1/1) ... [2023-01-28 00:39:32,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:39:32,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:39:32,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 00:39:32,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 00:39:32,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:39:32,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:39:32,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:39:32,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:39:32,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:39:32,246 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:39:32,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:39:32,249 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:39:32,250 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:39:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:39:32,250 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:39:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-28 00:39:32,250 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-28 00:39:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:39:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:39:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:39:32,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:39:32,251 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:39:32,367 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:39:32,380 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:39:32,627 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:39:32,726 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:39:32,726 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:39:32,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:39:32 BoogieIcfgContainer [2023-01-28 00:39:32,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:39:32,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:39:32,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:39:32,734 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:39:32,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:39:31" (1/3) ... [2023-01-28 00:39:32,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c61767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:39:32, skipping insertion in model container [2023-01-28 00:39:32,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:32" (2/3) ... [2023-01-28 00:39:32,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c61767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:39:32, skipping insertion in model container [2023-01-28 00:39:32,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:39:32" (3/3) ... [2023-01-28 00:39:32,735 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026.oepc.i [2023-01-28 00:39:32,746 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:39:32,747 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:39:32,747 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:39:32,795 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:39:32,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2023-01-28 00:39:32,871 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-01-28 00:39:32,871 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:39:32,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-01-28 00:39:32,877 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2023-01-28 00:39:32,884 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2023-01-28 00:39:32,887 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:39:32,902 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2023-01-28 00:39:32,905 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2023-01-28 00:39:32,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2023-01-28 00:39:32,936 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-01-28 00:39:32,936 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:39:32,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-01-28 00:39:32,939 INFO L119 LiptonReduction]: Number of co-enabled transitions 3164 [2023-01-28 00:39:36,088 INFO L134 LiptonReduction]: Checked pairs total: 9238 [2023-01-28 00:39:36,088 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-01-28 00:39:36,097 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:39:36,101 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;@635d6167, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:39:36,101 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-28 00:39:36,102 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-28 00:39:36,102 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:39:36,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:36,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 00:39:36,103 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:36,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:36,106 INFO L85 PathProgramCache]: Analyzing trace with hash 549528, now seen corresponding path program 1 times [2023-01-28 00:39:36,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:36,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52834010] [2023-01-28 00:39:36,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:36,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:36,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:36,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:36,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52834010] [2023-01-28 00:39:36,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52834010] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:36,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:36,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:39:36,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305178044] [2023-01-28 00:39:36,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:36,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:39:36,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:36,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:39:36,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:39:36,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 241 [2023-01-28 00:39:36,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:36,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:36,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 241 [2023-01-28 00:39:36,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:37,127 INFO L130 PetriNetUnfolder]: 4903/7131 cut-off events. [2023-01-28 00:39:37,127 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2023-01-28 00:39:37,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13979 conditions, 7131 events. 4903/7131 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 41983 event pairs, 895 based on Foata normal form. 0/6791 useless extension candidates. Maximal degree in co-relation 13967. Up to 5335 conditions per place. [2023-01-28 00:39:37,158 INFO L137 encePairwiseOnDemand]: 237/241 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-01-28 00:39:37,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 209 flow [2023-01-28 00:39:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:39:37,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:39:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2023-01-28 00:39:37,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5435684647302904 [2023-01-28 00:39:37,168 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2023-01-28 00:39:37,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2023-01-28 00:39:37,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:37,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2023-01-28 00:39:37,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:37,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:37,177 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:37,178 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 393 transitions. [2023-01-28 00:39:37,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 209 flow [2023-01-28 00:39:37,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 00:39:37,191 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-01-28 00:39:37,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, 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-28 00:39:37,194 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-01-28 00:39:37,195 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-01-28 00:39:37,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:37,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:37,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:37,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:39:37,195 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:37,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:37,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1011822437, now seen corresponding path program 1 times [2023-01-28 00:39:37,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:37,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355755770] [2023-01-28 00:39:37,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:37,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:37,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:37,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355755770] [2023-01-28 00:39:37,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355755770] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:37,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:37,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:39:37,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688624616] [2023-01-28 00:39:37,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:37,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:39:37,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:37,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:39:37,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:39:37,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 241 [2023-01-28 00:39:37,430 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-28 00:39:37,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:37,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 241 [2023-01-28 00:39:37,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:38,706 INFO L130 PetriNetUnfolder]: 14367/19536 cut-off events. [2023-01-28 00:39:38,707 INFO L131 PetriNetUnfolder]: For 1005/1005 co-relation queries the response was YES. [2023-01-28 00:39:38,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40520 conditions, 19536 events. 14367/19536 cut-off events. For 1005/1005 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 100276 event pairs, 5297 based on Foata normal form. 458/19994 useless extension candidates. Maximal degree in co-relation 40510. Up to 13505 conditions per place. [2023-01-28 00:39:38,798 INFO L137 encePairwiseOnDemand]: 233/241 looper letters, 46 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2023-01-28 00:39:38,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 232 flow [2023-01-28 00:39:38,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:39:38,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:39:38,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-01-28 00:39:38,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5103734439834025 [2023-01-28 00:39:38,801 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-01-28 00:39:38,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-01-28 00:39:38,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:38,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-01-28 00:39:38,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:38,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:38,805 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:38,805 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 369 transitions. [2023-01-28 00:39:38,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 232 flow [2023-01-28 00:39:38,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:39:38,807 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 118 flow [2023-01-28 00:39:38,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, 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=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-01-28 00:39:38,809 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-01-28 00:39:38,809 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 118 flow [2023-01-28 00:39:38,809 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-28 00:39:38,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:38,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:38,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:39:38,809 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:38,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:38,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1301726651, now seen corresponding path program 1 times [2023-01-28 00:39:38,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:38,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468274063] [2023-01-28 00:39:38,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:38,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:39,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:39,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468274063] [2023-01-28 00:39:39,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468274063] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:39,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:39,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:39:39,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624119971] [2023-01-28 00:39:39,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:39,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:39:39,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:39,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:39:39,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:39:39,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 241 [2023-01-28 00:39:39,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 118 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-28 00:39:39,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:39,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 241 [2023-01-28 00:39:39,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:40,258 INFO L130 PetriNetUnfolder]: 13285/18086 cut-off events. [2023-01-28 00:39:40,259 INFO L131 PetriNetUnfolder]: For 5515/5515 co-relation queries the response was YES. [2023-01-28 00:39:40,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43686 conditions, 18086 events. 13285/18086 cut-off events. For 5515/5515 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 89930 event pairs, 3757 based on Foata normal form. 230/18316 useless extension candidates. Maximal degree in co-relation 43674. Up to 8781 conditions per place. [2023-01-28 00:39:40,331 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 55 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2023-01-28 00:39:40,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 314 flow [2023-01-28 00:39:40,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:39:40,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:39:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2023-01-28 00:39:40,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.495850622406639 [2023-01-28 00:39:40,333 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2023-01-28 00:39:40,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2023-01-28 00:39:40,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:40,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2023-01-28 00:39:40,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:40,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:40,335 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:40,335 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 118 flow. Second operand 4 states and 478 transitions. [2023-01-28 00:39:40,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 314 flow [2023-01-28 00:39:40,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:39:40,379 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 152 flow [2023-01-28 00:39:40,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-01-28 00:39:40,380 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-01-28 00:39:40,382 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 152 flow [2023-01-28 00:39:40,383 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-28 00:39:40,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:40,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:40,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:39:40,383 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:40,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:40,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1701274142, now seen corresponding path program 1 times [2023-01-28 00:39:40,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:40,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831072091] [2023-01-28 00:39:40,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:40,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:40,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:40,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831072091] [2023-01-28 00:39:40,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831072091] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:40,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:40,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:39:40,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494029616] [2023-01-28 00:39:40,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:40,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:39:40,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:40,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:39:40,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:39:40,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 241 [2023-01-28 00:39:40,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:40,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:40,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 241 [2023-01-28 00:39:40,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:41,686 INFO L130 PetriNetUnfolder]: 8165/12127 cut-off events. [2023-01-28 00:39:41,687 INFO L131 PetriNetUnfolder]: For 2974/3344 co-relation queries the response was YES. [2023-01-28 00:39:41,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27858 conditions, 12127 events. 8165/12127 cut-off events. For 2974/3344 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 75281 event pairs, 1479 based on Foata normal form. 892/12754 useless extension candidates. Maximal degree in co-relation 27843. Up to 5207 conditions per place. [2023-01-28 00:39:41,791 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 57 selfloop transitions, 6 changer transitions 0/74 dead transitions. [2023-01-28 00:39:41,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 74 transitions, 382 flow [2023-01-28 00:39:41,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:39:41,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:39:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions. [2023-01-28 00:39:41,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5093360995850622 [2023-01-28 00:39:41,795 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 491 transitions. [2023-01-28 00:39:41,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 491 transitions. [2023-01-28 00:39:41,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:41,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 491 transitions. [2023-01-28 00:39:41,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:41,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:41,801 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:41,801 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 152 flow. Second operand 4 states and 491 transitions. [2023-01-28 00:39:41,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 74 transitions, 382 flow [2023-01-28 00:39:41,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 74 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:39:41,810 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 195 flow [2023-01-28 00:39:41,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-01-28 00:39:41,812 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2023-01-28 00:39:41,812 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 195 flow [2023-01-28 00:39:41,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:41,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:41,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:41,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:39:41,814 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:41,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:41,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1819110839, now seen corresponding path program 1 times [2023-01-28 00:39:41,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:41,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743349977] [2023-01-28 00:39:41,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:41,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:42,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:42,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743349977] [2023-01-28 00:39:42,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743349977] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:42,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:42,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:39:42,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363358360] [2023-01-28 00:39:42,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:42,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:39:42,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:42,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:39:42,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:39:42,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 241 [2023-01-28 00:39:42,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:42,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:42,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 241 [2023-01-28 00:39:42,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:42,827 INFO L130 PetriNetUnfolder]: 6526/10004 cut-off events. [2023-01-28 00:39:42,827 INFO L131 PetriNetUnfolder]: For 5211/5417 co-relation queries the response was YES. [2023-01-28 00:39:42,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28214 conditions, 10004 events. 6526/10004 cut-off events. For 5211/5417 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 63271 event pairs, 1399 based on Foata normal form. 590/10374 useless extension candidates. Maximal degree in co-relation 28196. Up to 3733 conditions per place. [2023-01-28 00:39:42,872 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 73 selfloop transitions, 10 changer transitions 0/94 dead transitions. [2023-01-28 00:39:42,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 94 transitions, 530 flow [2023-01-28 00:39:42,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:39:42,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:39:42,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2023-01-28 00:39:42,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5120331950207468 [2023-01-28 00:39:42,923 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2023-01-28 00:39:42,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2023-01-28 00:39:42,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:42,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2023-01-28 00:39:42,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:42,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:42,926 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:42,926 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 195 flow. Second operand 5 states and 617 transitions. [2023-01-28 00:39:42,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 94 transitions, 530 flow [2023-01-28 00:39:42,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 94 transitions, 527 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:39:42,932 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 260 flow [2023-01-28 00:39:42,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2023-01-28 00:39:42,932 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2023-01-28 00:39:42,933 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 260 flow [2023-01-28 00:39:42,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:42,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:42,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:42,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:39:42,933 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:42,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:42,934 INFO L85 PathProgramCache]: Analyzing trace with hash -493523634, now seen corresponding path program 1 times [2023-01-28 00:39:42,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:42,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503251668] [2023-01-28 00:39:42,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:42,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:43,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:43,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503251668] [2023-01-28 00:39:43,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503251668] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:43,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:43,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:39:43,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761540611] [2023-01-28 00:39:43,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:43,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:39:43,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:43,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:39:43,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:39:43,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 241 [2023-01-28 00:39:43,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 99.33333333333333) internal successors, (596), 6 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:43,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:43,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 241 [2023-01-28 00:39:43,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:44,628 INFO L130 PetriNetUnfolder]: 11286/16297 cut-off events. [2023-01-28 00:39:44,628 INFO L131 PetriNetUnfolder]: For 28664/28664 co-relation queries the response was YES. [2023-01-28 00:39:44,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55330 conditions, 16297 events. 11286/16297 cut-off events. For 28664/28664 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 93065 event pairs, 802 based on Foata normal form. 54/16351 useless extension candidates. Maximal degree in co-relation 55309. Up to 8044 conditions per place. [2023-01-28 00:39:44,680 INFO L137 encePairwiseOnDemand]: 228/241 looper letters, 129 selfloop transitions, 54 changer transitions 14/197 dead transitions. [2023-01-28 00:39:44,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 197 transitions, 1353 flow [2023-01-28 00:39:44,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 00:39:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 00:39:44,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1020 transitions. [2023-01-28 00:39:44,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4702627939142462 [2023-01-28 00:39:44,683 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1020 transitions. [2023-01-28 00:39:44,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1020 transitions. [2023-01-28 00:39:44,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:44,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1020 transitions. [2023-01-28 00:39:44,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 113.33333333333333) internal successors, (1020), 9 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:44,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 241.0) internal successors, (2410), 10 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:44,687 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 241.0) internal successors, (2410), 10 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:44,687 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 260 flow. Second operand 9 states and 1020 transitions. [2023-01-28 00:39:44,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 197 transitions, 1353 flow [2023-01-28 00:39:44,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 197 transitions, 1309 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-01-28 00:39:44,713 INFO L231 Difference]: Finished difference. Result has 67 places, 94 transitions, 710 flow [2023-01-28 00:39:44,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=710, PETRI_PLACES=67, PETRI_TRANSITIONS=94} [2023-01-28 00:39:44,714 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2023-01-28 00:39:44,714 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 94 transitions, 710 flow [2023-01-28 00:39:44,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.33333333333333) internal successors, (596), 6 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:44,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:44,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:44,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:39:44,715 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:44,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:44,715 INFO L85 PathProgramCache]: Analyzing trace with hash 660020462, now seen corresponding path program 2 times [2023-01-28 00:39:44,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:44,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518649799] [2023-01-28 00:39:44,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:44,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:44,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:44,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518649799] [2023-01-28 00:39:44,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518649799] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:44,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:44,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:39:44,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302569464] [2023-01-28 00:39:44,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:44,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:39:44,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:44,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:39:44,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:39:44,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 241 [2023-01-28 00:39:44,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 94 transitions, 710 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:44,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:44,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 241 [2023-01-28 00:39:44,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:45,370 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([406] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse8 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse6 (and .cse4 .cse11))) (let ((.cse2 (or .cse12 .cse9 .cse6)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~a~0_92 (ite .cse3 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse7 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 .cse1)) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse2 v_~a$w_buff0_used~0_140 (ite .cse3 0 v_~a$w_buff0_used~0_140)))) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse4 .cse5) .cse6 .cse7) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse7) .cse8) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse9 .cse6 .cse7) v_~a$w_buff1_used~0_131 0))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= .cse1 v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse10 .cse5) (and .cse10 .cse11) .cse7)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55)))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][95], [Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 193#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 195#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), Black: 191#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), P0Thread1of1ForFork1InUse, Black: 186#(and (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), 213#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 187#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 166#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 188#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), P3Thread1of1ForFork2InUse, 155#true, P1Thread1of1ForFork3InUse, 106#P0EXITtrue, 180#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 151#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 53#L842true, Black: 168#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 36#L873-3true, 117#L813true, Black: 176#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 64#L786true, 184#true]) [2023-01-28 00:39:45,370 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 00:39:45,370 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 00:39:45,370 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 00:39:45,371 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 00:39:45,447 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([406] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse8 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse6 (and .cse4 .cse11))) (let ((.cse2 (or .cse12 .cse9 .cse6)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~a~0_92 (ite .cse3 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse7 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 .cse1)) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse2 v_~a$w_buff0_used~0_140 (ite .cse3 0 v_~a$w_buff0_used~0_140)))) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse4 .cse5) .cse6 .cse7) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse7) .cse8) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse9 .cse6 .cse7) v_~a$w_buff1_used~0_131 0))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= .cse1 v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse10 .cse5) (and .cse10 .cse11) .cse7)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55)))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][132], [Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 193#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 195#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), Black: 191#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), P0Thread1of1ForFork1InUse, Black: 186#(and (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 187#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 166#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 188#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), 155#true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 106#P0EXITtrue, Black: 151#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 68#P2EXITtrue, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 53#L842true, Black: 168#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 36#L873-3true, 215#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), Black: 180#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 64#L786true, 176#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 184#true]) [2023-01-28 00:39:45,447 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 00:39:45,447 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 00:39:45,447 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 00:39:45,447 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 00:39:45,487 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([406] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse8 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse6 (and .cse4 .cse11))) (let ((.cse2 (or .cse12 .cse9 .cse6)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~a~0_92 (ite .cse3 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse7 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 .cse1)) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse2 v_~a$w_buff0_used~0_140 (ite .cse3 0 v_~a$w_buff0_used~0_140)))) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse4 .cse5) .cse6 .cse7) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse7) .cse8) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse9 .cse6 .cse7) v_~a$w_buff1_used~0_131 0))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= .cse1 v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse10 .cse5) (and .cse10 .cse11) .cse7)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55)))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][132], [Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 193#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 195#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), Black: 191#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), P0Thread1of1ForFork1InUse, Black: 186#(and (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), 102#L876true, Black: 187#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), P2Thread1of1ForFork0InUse, 155#true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 106#P0EXITtrue, Black: 151#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 68#P2EXITtrue, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 53#L842true, Black: 168#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 166#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 215#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), Black: 180#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 176#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 64#L786true, 184#true]) [2023-01-28 00:39:45,488 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-01-28 00:39:45,488 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-28 00:39:45,488 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-28 00:39:45,488 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-28 00:39:45,584 INFO L130 PetriNetUnfolder]: 3699/5840 cut-off events. [2023-01-28 00:39:45,584 INFO L131 PetriNetUnfolder]: For 13243/13641 co-relation queries the response was YES. [2023-01-28 00:39:45,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22132 conditions, 5840 events. 3699/5840 cut-off events. For 13243/13641 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 34538 event pairs, 502 based on Foata normal form. 437/6133 useless extension candidates. Maximal degree in co-relation 22104. Up to 1987 conditions per place. [2023-01-28 00:39:45,610 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 132 selfloop transitions, 14 changer transitions 4/182 dead transitions. [2023-01-28 00:39:45,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 182 transitions, 1433 flow [2023-01-28 00:39:45,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:39:45,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:39:45,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 739 transitions. [2023-01-28 00:39:45,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5110650069156293 [2023-01-28 00:39:45,612 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 739 transitions. [2023-01-28 00:39:45,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 739 transitions. [2023-01-28 00:39:45,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:45,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 739 transitions. [2023-01-28 00:39:45,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:45,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:45,615 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:45,615 INFO L175 Difference]: Start difference. First operand has 67 places, 94 transitions, 710 flow. Second operand 6 states and 739 transitions. [2023-01-28 00:39:45,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 182 transitions, 1433 flow [2023-01-28 00:39:45,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 182 transitions, 1411 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-28 00:39:45,689 INFO L231 Difference]: Finished difference. Result has 71 places, 97 transitions, 746 flow [2023-01-28 00:39:45,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=746, PETRI_PLACES=71, PETRI_TRANSITIONS=97} [2023-01-28 00:39:45,690 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2023-01-28 00:39:45,690 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 97 transitions, 746 flow [2023-01-28 00:39:45,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:45,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:45,691 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] [2023-01-28 00:39:45,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:39:45,691 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:45,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:45,691 INFO L85 PathProgramCache]: Analyzing trace with hash -447439276, now seen corresponding path program 1 times [2023-01-28 00:39:45,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:45,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899485573] [2023-01-28 00:39:45,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:45,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:46,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:46,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899485573] [2023-01-28 00:39:46,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899485573] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:46,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:46,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:39:46,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900018113] [2023-01-28 00:39:46,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:46,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:39:46,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:46,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:39:46,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:39:46,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 241 [2023-01-28 00:39:46,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 97 transitions, 746 flow. Second operand has 8 states, 8 states have (on average 102.125) internal successors, (817), 8 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:46,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:46,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 241 [2023-01-28 00:39:46,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:47,282 INFO L130 PetriNetUnfolder]: 7189/10780 cut-off events. [2023-01-28 00:39:47,283 INFO L131 PetriNetUnfolder]: For 28812/28812 co-relation queries the response was YES. [2023-01-28 00:39:47,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45430 conditions, 10780 events. 7189/10780 cut-off events. For 28812/28812 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 60813 event pairs, 938 based on Foata normal form. 13/10793 useless extension candidates. Maximal degree in co-relation 45400. Up to 4690 conditions per place. [2023-01-28 00:39:47,332 INFO L137 encePairwiseOnDemand]: 228/241 looper letters, 126 selfloop transitions, 67 changer transitions 99/292 dead transitions. [2023-01-28 00:39:47,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 292 transitions, 2573 flow [2023-01-28 00:39:47,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-28 00:39:47,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-28 00:39:47,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1262 transitions. [2023-01-28 00:39:47,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4760467748019615 [2023-01-28 00:39:47,335 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1262 transitions. [2023-01-28 00:39:47,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1262 transitions. [2023-01-28 00:39:47,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:47,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1262 transitions. [2023-01-28 00:39:47,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 114.72727272727273) internal successors, (1262), 11 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:47,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 241.0) internal successors, (2892), 12 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:47,341 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 241.0) internal successors, (2892), 12 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:47,341 INFO L175 Difference]: Start difference. First operand has 71 places, 97 transitions, 746 flow. Second operand 11 states and 1262 transitions. [2023-01-28 00:39:47,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 292 transitions, 2573 flow [2023-01-28 00:39:47,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 292 transitions, 2484 flow, removed 24 selfloop flow, removed 3 redundant places. [2023-01-28 00:39:47,515 INFO L231 Difference]: Finished difference. Result has 82 places, 121 transitions, 1094 flow [2023-01-28 00:39:47,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1094, PETRI_PLACES=82, PETRI_TRANSITIONS=121} [2023-01-28 00:39:47,517 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2023-01-28 00:39:47,517 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 121 transitions, 1094 flow [2023-01-28 00:39:47,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 102.125) internal successors, (817), 8 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:47,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:47,517 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-28 00:39:47,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:39:47,518 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:47,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:47,521 INFO L85 PathProgramCache]: Analyzing trace with hash 707565699, now seen corresponding path program 1 times [2023-01-28 00:39:47,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:47,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901474417] [2023-01-28 00:39:47,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:47,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:48,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:48,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:48,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901474417] [2023-01-28 00:39:48,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901474417] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:48,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:48,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 00:39:48,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773931544] [2023-01-28 00:39:48,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:48,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 00:39:48,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:48,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 00:39:48,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-01-28 00:39:48,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 241 [2023-01-28 00:39:48,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 121 transitions, 1094 flow. Second operand has 9 states, 9 states have (on average 96.66666666666667) internal successors, (870), 9 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:48,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:48,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 241 [2023-01-28 00:39:48,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:49,742 INFO L130 PetriNetUnfolder]: 7225/10753 cut-off events. [2023-01-28 00:39:49,742 INFO L131 PetriNetUnfolder]: For 28604/28604 co-relation queries the response was YES. [2023-01-28 00:39:49,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46706 conditions, 10753 events. 7225/10753 cut-off events. For 28604/28604 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 60879 event pairs, 884 based on Foata normal form. 16/10769 useless extension candidates. Maximal degree in co-relation 46672. Up to 3991 conditions per place. [2023-01-28 00:39:49,788 INFO L137 encePairwiseOnDemand]: 227/241 looper letters, 279 selfloop transitions, 128 changer transitions 25/432 dead transitions. [2023-01-28 00:39:49,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 432 transitions, 4226 flow [2023-01-28 00:39:49,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-28 00:39:49,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-28 00:39:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1231 transitions. [2023-01-28 00:39:49,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4643530743115805 [2023-01-28 00:39:49,791 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1231 transitions. [2023-01-28 00:39:49,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1231 transitions. [2023-01-28 00:39:49,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:49,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1231 transitions. [2023-01-28 00:39:49,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 111.9090909090909) internal successors, (1231), 11 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:49,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 241.0) internal successors, (2892), 12 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:49,797 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 241.0) internal successors, (2892), 12 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:49,797 INFO L175 Difference]: Start difference. First operand has 82 places, 121 transitions, 1094 flow. Second operand 11 states and 1231 transitions. [2023-01-28 00:39:49,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 432 transitions, 4226 flow [2023-01-28 00:39:50,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 432 transitions, 4079 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-01-28 00:39:50,023 INFO L231 Difference]: Finished difference. Result has 94 places, 224 transitions, 2724 flow [2023-01-28 00:39:50,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2724, PETRI_PLACES=94, PETRI_TRANSITIONS=224} [2023-01-28 00:39:50,024 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places. [2023-01-28 00:39:50,024 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 224 transitions, 2724 flow [2023-01-28 00:39:50,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 96.66666666666667) internal successors, (870), 9 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:50,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:50,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:50,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:39:50,025 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:50,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:50,026 INFO L85 PathProgramCache]: Analyzing trace with hash -780855464, now seen corresponding path program 1 times [2023-01-28 00:39:50,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:50,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443883929] [2023-01-28 00:39:50,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:50,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:50,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:50,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443883929] [2023-01-28 00:39:50,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443883929] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:50,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:50,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:39:50,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750927573] [2023-01-28 00:39:50,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:50,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:39:50,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:50,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:39:50,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:39:50,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 241 [2023-01-28 00:39:50,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 224 transitions, 2724 flow. Second operand has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:50,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:50,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 241 [2023-01-28 00:39:50,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:51,649 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([406] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse8 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse6 (and .cse4 .cse11))) (let ((.cse2 (or .cse12 .cse9 .cse6)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~a~0_92 (ite .cse3 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse7 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 .cse1)) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse2 v_~a$w_buff0_used~0_140 (ite .cse3 0 v_~a$w_buff0_used~0_140)))) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse4 .cse5) .cse6 .cse7) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse7) .cse8) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse9 .cse6 .cse7) v_~a$w_buff1_used~0_131 0))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= .cse1 v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse10 .cse5) (and .cse10 .cse11) .cse7)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55)))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][170], [Black: 248#(and (not (= ~a$w_buff0~0 0)) (= ~__unbuffered_p0_EAX~0 ~a~0) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 250#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 244#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 193#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 195#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), Black: 245#(and (= ~a$w_buff0~0 0) (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 191#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 252#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 186#(and (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), P0Thread1of1ForFork1InUse, Black: 187#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 246#(and (not (= ~a$w_buff0~0 0)) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), P2Thread1of1ForFork0InUse, Black: 188#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), Black: 258#(and (not (= ~a$w_buff0~0 0)) (= ~__unbuffered_p0_EAX~0 ~a$w_buff0~0) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 256#(and (not (= ~a$w_buff0~0 0)) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 155#true, P3Thread1of1ForFork2InUse, 209#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork3InUse, 271#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 106#P0EXITtrue, Black: 151#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 242#true, Black: 215#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 68#P2EXITtrue, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 53#L842true, Black: 168#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 36#L873-3true, 219#true, Black: 234#(and (= ~x~0 ~a$w_buff0~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 222#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), 112#P1EXITtrue, Black: 180#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 184#true]) [2023-01-28 00:39:51,650 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-01-28 00:39:51,650 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-28 00:39:51,650 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-28 00:39:51,650 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-28 00:39:51,730 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([406] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse8 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse6 (and .cse4 .cse11))) (let ((.cse2 (or .cse12 .cse9 .cse6)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~a~0_92 (ite .cse3 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse7 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 .cse1)) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse2 v_~a$w_buff0_used~0_140 (ite .cse3 0 v_~a$w_buff0_used~0_140)))) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse4 .cse5) .cse6 .cse7) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse7) .cse8) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse9 .cse6 .cse7) v_~a$w_buff1_used~0_131 0))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= .cse1 v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse10 .cse5) (and .cse10 .cse11) .cse7)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55)))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][170], [Black: 248#(and (not (= ~a$w_buff0~0 0)) (= ~__unbuffered_p0_EAX~0 ~a~0) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 250#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 244#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 193#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 195#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), Black: 245#(and (= ~a$w_buff0~0 0) (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 191#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 186#(and (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), 102#L876true, Black: 252#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), P0Thread1of1ForFork1InUse, Black: 187#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 246#(and (not (= ~a$w_buff0~0 0)) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), P2Thread1of1ForFork0InUse, Black: 258#(and (not (= ~a$w_buff0~0 0)) (= ~__unbuffered_p0_EAX~0 ~a$w_buff0~0) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 256#(and (not (= ~a$w_buff0~0 0)) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 155#true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 271#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 106#P0EXITtrue, Black: 151#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 242#true, Black: 215#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 68#P2EXITtrue, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 53#L842true, Black: 168#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 219#true, Black: 234#(and (= ~x~0 ~a$w_buff0~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 222#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), 112#P1EXITtrue, Black: 180#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 184#true]) [2023-01-28 00:39:51,730 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-01-28 00:39:51,731 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-01-28 00:39:51,731 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-01-28 00:39:51,731 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-01-28 00:39:51,779 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([406] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse8 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse6 (and .cse4 .cse11))) (let ((.cse2 (or .cse12 .cse9 .cse6)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~a~0_92 (ite .cse3 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse7 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 .cse1)) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse2 v_~a$w_buff0_used~0_140 (ite .cse3 0 v_~a$w_buff0_used~0_140)))) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse4 .cse5) .cse6 .cse7) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse7) .cse8) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse9 .cse6 .cse7) v_~a$w_buff1_used~0_131 0))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= .cse1 v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse10 .cse5) (and .cse10 .cse11) .cse7)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55)))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][170], [Black: 248#(and (not (= ~a$w_buff0~0 0)) (= ~__unbuffered_p0_EAX~0 ~a~0) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 250#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 244#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 193#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 195#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), Black: 245#(and (= ~a$w_buff0~0 0) (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 191#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 252#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), P0Thread1of1ForFork1InUse, Black: 186#(and (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 246#(and (not (= ~a$w_buff0~0 0)) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 187#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), P2Thread1of1ForFork0InUse, Black: 258#(and (not (= ~a$w_buff0~0 0)) (= ~__unbuffered_p0_EAX~0 ~a$w_buff0~0) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), Black: 256#(and (not (= ~a$w_buff0~0 0)) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 155#true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 271#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 106#P0EXITtrue, Black: 215#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 242#true, Black: 151#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 68#P2EXITtrue, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 168#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 53#L842true, 219#true, Black: 234#(and (= ~x~0 ~a$w_buff0~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 222#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), 112#P1EXITtrue, Black: 180#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 28#L884true, 184#true]) [2023-01-28 00:39:51,779 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-01-28 00:39:51,779 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-01-28 00:39:51,780 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-01-28 00:39:51,780 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-01-28 00:39:51,812 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([521] L884-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25| 0) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_16 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_16) (= v_~z~0_18 2) (= v_~__unbuffered_p1_EAX~0_16 0) (= 0 v_~__unbuffered_p3_EBX~0_26) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][332], [Black: 248#(and (not (= ~a$w_buff0~0 0)) (= ~__unbuffered_p0_EAX~0 ~a~0) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 250#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 193#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 244#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 195#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), Black: 245#(and (= ~a$w_buff0~0 0) (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 191#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 252#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 186#(and (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), P0Thread1of1ForFork1InUse, Black: 187#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 246#(and (not (= ~a$w_buff0~0 0)) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), P2Thread1of1ForFork0InUse, Black: 258#(and (not (= ~a$w_buff0~0 0)) (= ~__unbuffered_p0_EAX~0 ~a$w_buff0~0) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), Black: 256#(and (not (= ~a$w_buff0~0 0)) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), P3Thread1of1ForFork2InUse, 155#true, P1Thread1of1ForFork3InUse, 271#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 106#P0EXITtrue, Black: 151#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 215#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 242#true, 68#P2EXITtrue, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 83#L826true, 122#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 168#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 219#true, Black: 234#(and (= ~x~0 ~a$w_buff0~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 222#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), 112#P1EXITtrue, Black: 180#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 184#true]) [2023-01-28 00:39:51,812 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2023-01-28 00:39:51,812 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2023-01-28 00:39:51,812 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2023-01-28 00:39:51,812 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2023-01-28 00:39:51,858 INFO L130 PetriNetUnfolder]: 7280/11759 cut-off events. [2023-01-28 00:39:51,858 INFO L131 PetriNetUnfolder]: For 53700/54459 co-relation queries the response was YES. [2023-01-28 00:39:51,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56036 conditions, 11759 events. 7280/11759 cut-off events. For 53700/54459 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 79252 event pairs, 1265 based on Foata normal form. 307/11798 useless extension candidates. Maximal degree in co-relation 55994. Up to 3760 conditions per place. [2023-01-28 00:39:52,017 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 160 selfloop transitions, 45 changer transitions 71/357 dead transitions. [2023-01-28 00:39:52,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 357 transitions, 4239 flow [2023-01-28 00:39:52,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:39:52,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:39:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 828 transitions. [2023-01-28 00:39:52,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4908120924718435 [2023-01-28 00:39:52,020 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 828 transitions. [2023-01-28 00:39:52,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 828 transitions. [2023-01-28 00:39:52,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:52,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 828 transitions. [2023-01-28 00:39:52,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:52,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:52,023 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:52,023 INFO L175 Difference]: Start difference. First operand has 94 places, 224 transitions, 2724 flow. Second operand 7 states and 828 transitions. [2023-01-28 00:39:52,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 357 transitions, 4239 flow [2023-01-28 00:39:52,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 357 transitions, 4211 flow, removed 14 selfloop flow, removed 0 redundant places. [2023-01-28 00:39:52,420 INFO L231 Difference]: Finished difference. Result has 104 places, 224 transitions, 2866 flow [2023-01-28 00:39:52,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=2700, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2866, PETRI_PLACES=104, PETRI_TRANSITIONS=224} [2023-01-28 00:39:52,420 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places. [2023-01-28 00:39:52,421 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 224 transitions, 2866 flow [2023-01-28 00:39:52,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:52,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:52,421 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] [2023-01-28 00:39:52,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:39:52,421 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:52,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:52,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1048013744, now seen corresponding path program 2 times [2023-01-28 00:39:52,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:52,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042357486] [2023-01-28 00:39:52,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:52,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:52,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:52,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042357486] [2023-01-28 00:39:52,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042357486] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:52,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:52,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:39:52,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068463570] [2023-01-28 00:39:52,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:52,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:39:52,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:52,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:39:52,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:39:52,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 241 [2023-01-28 00:39:52,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 224 transitions, 2866 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:52,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:52,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 241 [2023-01-28 00:39:52,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:54,292 INFO L130 PetriNetUnfolder]: 9839/15551 cut-off events. [2023-01-28 00:39:54,292 INFO L131 PetriNetUnfolder]: For 92194/92521 co-relation queries the response was YES. [2023-01-28 00:39:54,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80760 conditions, 15551 events. 9839/15551 cut-off events. For 92194/92521 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 104581 event pairs, 2453 based on Foata normal form. 211/15635 useless extension candidates. Maximal degree in co-relation 80712. Up to 6661 conditions per place. [2023-01-28 00:39:54,386 INFO L137 encePairwiseOnDemand]: 237/241 looper letters, 170 selfloop transitions, 29 changer transitions 162/378 dead transitions. [2023-01-28 00:39:54,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 378 transitions, 5152 flow [2023-01-28 00:39:54,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:39:54,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:39:54,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 498 transitions. [2023-01-28 00:39:54,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.516597510373444 [2023-01-28 00:39:54,388 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 498 transitions. [2023-01-28 00:39:54,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 498 transitions. [2023-01-28 00:39:54,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:54,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 498 transitions. [2023-01-28 00:39:54,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:54,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:54,391 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:54,391 INFO L175 Difference]: Start difference. First operand has 104 places, 224 transitions, 2866 flow. Second operand 4 states and 498 transitions. [2023-01-28 00:39:54,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 378 transitions, 5152 flow [2023-01-28 00:39:55,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 378 transitions, 5071 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-01-28 00:39:55,123 INFO L231 Difference]: Finished difference. Result has 103 places, 164 transitions, 1904 flow [2023-01-28 00:39:55,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=2797, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1904, PETRI_PLACES=103, PETRI_TRANSITIONS=164} [2023-01-28 00:39:55,124 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 60 predicate places. [2023-01-28 00:39:55,124 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 164 transitions, 1904 flow [2023-01-28 00:39:55,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:55,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:55,125 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-28 00:39:55,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:39:55,125 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:55,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:55,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1866422155, now seen corresponding path program 2 times [2023-01-28 00:39:55,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:55,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853200988] [2023-01-28 00:39:55,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:55,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:55,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:55,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853200988] [2023-01-28 00:39:55,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853200988] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:55,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:55,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:39:55,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373877028] [2023-01-28 00:39:55,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:55,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:39:55,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:55,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:39:55,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:39:55,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 241 [2023-01-28 00:39:55,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 164 transitions, 1904 flow. Second operand has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:55,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:55,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 241 [2023-01-28 00:39:55,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:57,063 INFO L130 PetriNetUnfolder]: 6075/10180 cut-off events. [2023-01-28 00:39:57,063 INFO L131 PetriNetUnfolder]: For 52769/53350 co-relation queries the response was YES. [2023-01-28 00:39:57,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49960 conditions, 10180 events. 6075/10180 cut-off events. For 52769/53350 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 70974 event pairs, 475 based on Foata normal form. 206/10222 useless extension candidates. Maximal degree in co-relation 49913. Up to 3590 conditions per place. [2023-01-28 00:39:57,129 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 170 selfloop transitions, 51 changer transitions 51/304 dead transitions. [2023-01-28 00:39:57,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 304 transitions, 3495 flow [2023-01-28 00:39:57,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:39:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:39:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 832 transitions. [2023-01-28 00:39:57,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49318316538233553 [2023-01-28 00:39:57,131 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 832 transitions. [2023-01-28 00:39:57,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 832 transitions. [2023-01-28 00:39:57,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:57,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 832 transitions. [2023-01-28 00:39:57,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.85714285714286) internal successors, (832), 7 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:57,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:57,135 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:57,135 INFO L175 Difference]: Start difference. First operand has 103 places, 164 transitions, 1904 flow. Second operand 7 states and 832 transitions. [2023-01-28 00:39:57,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 304 transitions, 3495 flow [2023-01-28 00:39:57,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 304 transitions, 3367 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-01-28 00:39:57,516 INFO L231 Difference]: Finished difference. Result has 108 places, 173 transitions, 2107 flow [2023-01-28 00:39:57,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=1789, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2107, PETRI_PLACES=108, PETRI_TRANSITIONS=173} [2023-01-28 00:39:57,517 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 65 predicate places. [2023-01-28 00:39:57,517 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 173 transitions, 2107 flow [2023-01-28 00:39:57,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:57,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:57,517 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] [2023-01-28 00:39:57,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 00:39:57,518 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:57,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:57,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1478996784, now seen corresponding path program 3 times [2023-01-28 00:39:57,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:57,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696402304] [2023-01-28 00:39:57,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:57,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:57,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:57,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:57,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696402304] [2023-01-28 00:39:57,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696402304] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:57,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:57,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:39:57,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445906114] [2023-01-28 00:39:57,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:57,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:39:57,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:57,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:39:57,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:39:57,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 241 [2023-01-28 00:39:57,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 173 transitions, 2107 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:57,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:57,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 241 [2023-01-28 00:39:57,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:59,470 INFO L130 PetriNetUnfolder]: 9384/15597 cut-off events. [2023-01-28 00:39:59,470 INFO L131 PetriNetUnfolder]: For 106769/107349 co-relation queries the response was YES. [2023-01-28 00:39:59,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82094 conditions, 15597 events. 9384/15597 cut-off events. For 106769/107349 co-relation queries the response was YES. Maximal size of possible extension queue 800. Compared 115054 event pairs, 2020 based on Foata normal form. 193/15667 useless extension candidates. Maximal degree in co-relation 82043. Up to 7052 conditions per place. [2023-01-28 00:39:59,574 INFO L137 encePairwiseOnDemand]: 238/241 looper letters, 197 selfloop transitions, 2 changer transitions 129/349 dead transitions. [2023-01-28 00:39:59,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 349 transitions, 4861 flow [2023-01-28 00:39:59,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:39:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:39:59,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2023-01-28 00:39:59,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197095435684648 [2023-01-28 00:39:59,577 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 501 transitions. [2023-01-28 00:39:59,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 501 transitions. [2023-01-28 00:39:59,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:59,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 501 transitions. [2023-01-28 00:39:59,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:59,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:59,579 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:59,579 INFO L175 Difference]: Start difference. First operand has 108 places, 173 transitions, 2107 flow. Second operand 4 states and 501 transitions. [2023-01-28 00:39:59,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 349 transitions, 4861 flow [2023-01-28 00:40:00,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 349 transitions, 4754 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-01-28 00:40:00,527 INFO L231 Difference]: Finished difference. Result has 107 places, 164 transitions, 1948 flow [2023-01-28 00:40:00,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=2054, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1948, PETRI_PLACES=107, PETRI_TRANSITIONS=164} [2023-01-28 00:40:00,528 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 64 predicate places. [2023-01-28 00:40:00,528 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 164 transitions, 1948 flow [2023-01-28 00:40:00,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:00,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:40:00,528 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-28 00:40:00,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 00:40:00,528 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:40:00,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:40:00,529 INFO L85 PathProgramCache]: Analyzing trace with hash 547146855, now seen corresponding path program 3 times [2023-01-28 00:40:00,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:40:00,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127969095] [2023-01-28 00:40:00,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:40:00,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:40:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:40:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:40:00,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:40:00,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127969095] [2023-01-28 00:40:00,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127969095] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:40:00,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:40:00,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:40:00,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668582952] [2023-01-28 00:40:00,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:40:00,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:40:00,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:40:00,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:40:00,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:40:00,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 241 [2023-01-28 00:40:00,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 164 transitions, 1948 flow. Second operand has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:00,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:40:00,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 241 [2023-01-28 00:40:00,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:40:02,154 INFO L130 PetriNetUnfolder]: 7751/12991 cut-off events. [2023-01-28 00:40:02,154 INFO L131 PetriNetUnfolder]: For 89605/90747 co-relation queries the response was YES. [2023-01-28 00:40:02,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64654 conditions, 12991 events. 7751/12991 cut-off events. For 89605/90747 co-relation queries the response was YES. Maximal size of possible extension queue 755. Compared 98486 event pairs, 808 based on Foata normal form. 633/13363 useless extension candidates. Maximal degree in co-relation 64604. Up to 4934 conditions per place. [2023-01-28 00:40:02,265 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 191 selfloop transitions, 18 changer transitions 60/291 dead transitions. [2023-01-28 00:40:02,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 291 transitions, 3723 flow [2023-01-28 00:40:02,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:40:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:40:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 834 transitions. [2023-01-28 00:40:02,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4943687018375815 [2023-01-28 00:40:02,267 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 834 transitions. [2023-01-28 00:40:02,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 834 transitions. [2023-01-28 00:40:02,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:40:02,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 834 transitions. [2023-01-28 00:40:02,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.14285714285714) internal successors, (834), 7 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:02,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:02,271 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:02,271 INFO L175 Difference]: Start difference. First operand has 107 places, 164 transitions, 1948 flow. Second operand 7 states and 834 transitions. [2023-01-28 00:40:02,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 291 transitions, 3723 flow [2023-01-28 00:40:03,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 291 transitions, 3678 flow, removed 19 selfloop flow, removed 2 redundant places. [2023-01-28 00:40:03,340 INFO L231 Difference]: Finished difference. Result has 113 places, 135 transitions, 1536 flow [2023-01-28 00:40:03,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=1833, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1536, PETRI_PLACES=113, PETRI_TRANSITIONS=135} [2023-01-28 00:40:03,341 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 70 predicate places. [2023-01-28 00:40:03,341 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 135 transitions, 1536 flow [2023-01-28 00:40:03,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:03,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:40:03,341 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-28 00:40:03,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 00:40:03,342 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-28 00:40:03,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:40:03,342 INFO L85 PathProgramCache]: Analyzing trace with hash 256999797, now seen corresponding path program 1 times [2023-01-28 00:40:03,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:40:03,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025316342] [2023-01-28 00:40:03,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:40:03,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:40:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:40:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:40:04,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:40:04,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025316342] [2023-01-28 00:40:04,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025316342] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:40:04,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:40:04,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:40:04,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545702979] [2023-01-28 00:40:04,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:40:04,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:40:04,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:40:04,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:40:04,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:40:04,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 241 [2023-01-28 00:40:04,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 135 transitions, 1536 flow. Second operand has 8 states, 8 states have (on average 106.0) internal successors, (848), 8 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:04,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:40:04,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 241 [2023-01-28 00:40:04,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:40:04,692 INFO L130 PetriNetUnfolder]: 2881/4946 cut-off events. [2023-01-28 00:40:04,692 INFO L131 PetriNetUnfolder]: For 27090/27293 co-relation queries the response was YES. [2023-01-28 00:40:04,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25925 conditions, 4946 events. 2881/4946 cut-off events. For 27090/27293 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 30874 event pairs, 405 based on Foata normal form. 41/4876 useless extension candidates. Maximal degree in co-relation 25881. Up to 1846 conditions per place. [2023-01-28 00:40:04,721 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 134 selfloop transitions, 25 changer transitions 47/226 dead transitions. [2023-01-28 00:40:04,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 226 transitions, 2676 flow [2023-01-28 00:40:04,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:40:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:40:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 800 transitions. [2023-01-28 00:40:04,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742145820983995 [2023-01-28 00:40:04,723 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 800 transitions. [2023-01-28 00:40:04,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 800 transitions. [2023-01-28 00:40:04,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:40:04,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 800 transitions. [2023-01-28 00:40:04,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:04,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:04,726 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:04,726 INFO L175 Difference]: Start difference. First operand has 113 places, 135 transitions, 1536 flow. Second operand 7 states and 800 transitions. [2023-01-28 00:40:04,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 226 transitions, 2676 flow [2023-01-28 00:40:04,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 226 transitions, 2282 flow, removed 84 selfloop flow, removed 15 redundant places. [2023-01-28 00:40:04,917 INFO L231 Difference]: Finished difference. Result has 104 places, 119 transitions, 1196 flow [2023-01-28 00:40:04,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1196, PETRI_PLACES=104, PETRI_TRANSITIONS=119} [2023-01-28 00:40:04,918 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places. [2023-01-28 00:40:04,918 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 119 transitions, 1196 flow [2023-01-28 00:40:04,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.0) internal successors, (848), 8 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:04,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:40:04,918 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-28 00:40:04,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 00:40:04,918 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:40:04,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:40:04,919 INFO L85 PathProgramCache]: Analyzing trace with hash 442705501, now seen corresponding path program 2 times [2023-01-28 00:40:04,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:40:04,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271595696] [2023-01-28 00:40:04,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:40:04,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:40:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:40:04,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:40:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:40:05,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:40:05,068 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:40:05,069 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-28 00:40:05,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-28 00:40:05,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-28 00:40:05,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-28 00:40:05,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-28 00:40:05,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-28 00:40:05,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-28 00:40:05,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 00:40:05,074 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-01-28 00:40:05,078 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:40:05,078 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:40:05,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:40:05 BasicIcfg [2023-01-28 00:40:05,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:40:05,146 INFO L158 Benchmark]: Toolchain (without parser) took 33496.64ms. Allocated memory was 507.5MB in the beginning and 3.6GB in the end (delta: 3.1GB). Free memory was 459.8MB in the beginning and 3.4GB in the end (delta: -2.9GB). Peak memory consumption was 196.4MB. Max. memory is 16.0GB. [2023-01-28 00:40:05,146 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 343.9MB. Free memory was 289.1MB in the beginning and 289.0MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:40:05,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.62ms. Allocated memory is still 507.5MB. Free memory was 459.4MB in the beginning and 435.6MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 00:40:05,146 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.83ms. Allocated memory is still 507.5MB. Free memory was 435.6MB in the beginning and 433.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:40:05,147 INFO L158 Benchmark]: Boogie Preprocessor took 42.20ms. Allocated memory is still 507.5MB. Free memory was 433.0MB in the beginning and 430.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:40:05,147 INFO L158 Benchmark]: RCFGBuilder took 545.81ms. Allocated memory is still 507.5MB. Free memory was 430.9MB in the beginning and 450.5MB in the end (delta: -19.6MB). Peak memory consumption was 32.5MB. Max. memory is 16.0GB. [2023-01-28 00:40:05,147 INFO L158 Benchmark]: TraceAbstraction took 32413.98ms. Allocated memory was 507.5MB in the beginning and 3.6GB in the end (delta: 3.1GB). Free memory was 449.3MB in the beginning and 3.4GB in the end (delta: -2.9GB). Peak memory consumption was 182.8MB. Max. memory is 16.0GB. [2023-01-28 00:40:05,148 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.09ms. Allocated memory is still 343.9MB. Free memory was 289.1MB in the beginning and 289.0MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 437.62ms. Allocated memory is still 507.5MB. Free memory was 459.4MB in the beginning and 435.6MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 50.83ms. Allocated memory is still 507.5MB. Free memory was 435.6MB in the beginning and 433.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 42.20ms. Allocated memory is still 507.5MB. Free memory was 433.0MB in the beginning and 430.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 545.81ms. Allocated memory is still 507.5MB. Free memory was 430.9MB in the beginning and 450.5MB in the end (delta: -19.6MB). Peak memory consumption was 32.5MB. Max. memory is 16.0GB. * TraceAbstraction took 32413.98ms. Allocated memory was 507.5MB in the beginning and 3.6GB in the end (delta: 3.1GB). Free memory was 449.3MB in the beginning and 3.4GB in the end (delta: -2.9GB). Peak memory consumption was 182.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 138 PlacesBefore, 43 PlacesAfterwards, 127 TransitionsBefore, 31 TransitionsAfterwards, 3164 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 9238 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3488, independent: 3243, independent conditional: 0, independent unconditional: 3243, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1676, independent: 1630, independent conditional: 0, independent unconditional: 1630, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3488, independent: 1613, independent conditional: 0, independent unconditional: 1613, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 1676, unknown conditional: 0, unknown unconditional: 1676] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 143, Positive conditional cache size: 0, Positive unconditional cache size: 143, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t681; [L867] FCALL, FORK 0 pthread_create(&t681, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t681, ((void *)0), P0, ((void *)0))=-3, t681={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t682; [L869] FCALL, FORK 0 pthread_create(&t682, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t682, ((void *)0), P1, ((void *)0))=-2, t681={5:0}, t682={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t683; [L871] FCALL, FORK 0 pthread_create(&t683, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t683, ((void *)0), P2, ((void *)0))=-1, t681={5:0}, t682={6:0}, t683={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t684; [L873] FCALL, FORK 0 pthread_create(&t684, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t684, ((void *)0), P3, ((void *)0))=0, t681={5:0}, t682={6:0}, t683={7:0}, t684={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L822] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t681={5:0}, t682={6:0}, t683={7:0}, t684={3:0}, weak$$choice2=1, x=1, y=1, z=2] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t681={5:0}, t682={6:0}, t683={7:0}, t684={3:0}, weak$$choice2=1, x=1, y=1, z=2] [L886] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L888] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, 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: 867]: 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: 871]: 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: 873]: 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: 869]: 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, 168 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.3s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 23.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 946 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 946 mSDsluCounter, 155 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 104 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2831 IncrementalHoareTripleChecker+Invalid, 2935 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 51 mSDtfsCounter, 2831 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2866occurred in iteration=10, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 322 NumberOfCodeBlocks, 322 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 3017 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 00:40:05,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...