/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 AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 07:01:58,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 07:01:58,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 07:01:58,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 07:01:58,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 07:01:58,118 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 07:01:58,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 07:01:58,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 07:01:58,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 07:01:58,122 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 07:01:58,123 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 07:01:58,124 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 07:01:58,124 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 07:01:58,125 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 07:01:58,126 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 07:01:58,127 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 07:01:58,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 07:01:58,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 07:01:58,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 07:01:58,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 07:01:58,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 07:01:58,135 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 07:01:58,136 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 07:01:58,137 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 07:01:58,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 07:01:58,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 07:01:58,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 07:01:58,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 07:01:58,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 07:01:58,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 07:01:58,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 07:01:58,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 07:01:58,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 07:01:58,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 07:01:58,144 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 07:01:58,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 07:01:58,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 07:01:58,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 07:01:58,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 07:01:58,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 07:01:58,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 07:01:58,151 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 07:01:58,168 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 07:01:58,168 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 07:01:58,169 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 07:01:58,169 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 07:01:58,170 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 07:01:58,170 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 07:01:58,170 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 07:01:58,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 07:01:58,170 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 07:01:58,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 07:01:58,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 07:01:58,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 07:01:58,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 07:01:58,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 07:01:58,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 07:01:58,171 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 07:01:58,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 07:01:58,172 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 07:01:58,172 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 07:01:58,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 07:01:58,172 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 07:01:58,172 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 07:01:58,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 07:01:58,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:01:58,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 07:01:58,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 07:01:58,173 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 07:01:58,173 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 07:01:58,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 07:01:58,174 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 07:01:58,174 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 07:01:58,174 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 -> AFTER [2023-01-28 07:01:58,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 07:01:58,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 07:01:58,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 07:01:58,413 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 07:01:58,414 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 07:01:58,415 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i [2023-01-28 07:01:59,455 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 07:01:59,688 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 07:01:59,688 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i [2023-01-28 07:01:59,703 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6816dff5/da8e79ceb4cb4ef9974ab8cda1aa5f07/FLAG609431273 [2023-01-28 07:01:59,715 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6816dff5/da8e79ceb4cb4ef9974ab8cda1aa5f07 [2023-01-28 07:01:59,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 07:01:59,718 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 07:01:59,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 07:01:59,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 07:01:59,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 07:01:59,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:01:59" (1/1) ... [2023-01-28 07:01:59,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@498ab381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:59, skipping insertion in model container [2023-01-28 07:01:59,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:01:59" (1/1) ... [2023-01-28 07:01:59,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 07:01:59,777 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 07:01:59,932 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/safe016_rmo.oepc.i[993,1006] [2023-01-28 07:02:00,151 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:02:00,163 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 07:02:00,174 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/safe016_rmo.oepc.i[993,1006] [2023-01-28 07:02:00,221 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:02:00,252 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 07:02:00,252 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 07:02:00,258 INFO L208 MainTranslator]: Completed translation [2023-01-28 07:02:00,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:00 WrapperNode [2023-01-28 07:02:00,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 07:02:00,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 07:02:00,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 07:02:00,260 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 07:02:00,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:00" (1/1) ... [2023-01-28 07:02:00,299 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:00" (1/1) ... [2023-01-28 07:02:00,342 INFO L138 Inliner]: procedures = 177, calls = 85, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 188 [2023-01-28 07:02:00,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 07:02:00,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 07:02:00,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 07:02:00,344 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 07:02:00,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:00" (1/1) ... [2023-01-28 07:02:00,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:00" (1/1) ... [2023-01-28 07:02:00,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:00" (1/1) ... [2023-01-28 07:02:00,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:00" (1/1) ... [2023-01-28 07:02:00,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:00" (1/1) ... [2023-01-28 07:02:00,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:00" (1/1) ... [2023-01-28 07:02:00,391 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:00" (1/1) ... [2023-01-28 07:02:00,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:00" (1/1) ... [2023-01-28 07:02:00,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 07:02:00,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 07:02:00,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 07:02:00,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 07:02:00,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:00" (1/1) ... [2023-01-28 07:02:00,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:02:00,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:02:00,438 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 07:02:00,464 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 07:02:00,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 07:02:00,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 07:02:00,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 07:02:00,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 07:02:00,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 07:02:00,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 07:02:00,480 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 07:02:00,481 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 07:02:00,481 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 07:02:00,481 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 07:02:00,482 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 07:02:00,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 07:02:00,482 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-28 07:02:00,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-28 07:02:00,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 07:02:00,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 07:02:00,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 07:02:00,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 07:02:00,484 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 07:02:00,632 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 07:02:00,633 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 07:02:01,188 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 07:02:01,450 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 07:02:01,451 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 07:02:01,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:02:01 BoogieIcfgContainer [2023-01-28 07:02:01,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 07:02:01,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 07:02:01,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 07:02:01,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 07:02:01,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 07:01:59" (1/3) ... [2023-01-28 07:02:01,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fb5bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:02:01, skipping insertion in model container [2023-01-28 07:02:01,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:00" (2/3) ... [2023-01-28 07:02:01,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fb5bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:02:01, skipping insertion in model container [2023-01-28 07:02:01,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:02:01" (3/3) ... [2023-01-28 07:02:01,462 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_rmo.oepc.i [2023-01-28 07:02:01,477 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 07:02:01,478 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 07:02:01,478 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 07:02:01,555 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 07:02:01,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 304 flow [2023-01-28 07:02:01,679 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-01-28 07:02:01,680 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:02:01,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2023-01-28 07:02:01,685 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 142 transitions, 304 flow [2023-01-28 07:02:01,698 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 124 transitions, 260 flow [2023-01-28 07:02:01,701 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 07:02:01,715 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 124 transitions, 260 flow [2023-01-28 07:02:01,740 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 124 transitions, 260 flow [2023-01-28 07:02:01,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 124 transitions, 260 flow [2023-01-28 07:02:01,774 INFO L130 PetriNetUnfolder]: 1/124 cut-off events. [2023-01-28 07:02:01,774 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:02:01,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 1/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-28 07:02:01,777 INFO L119 LiptonReduction]: Number of co-enabled transitions 1736 [2023-01-28 07:02:10,507 INFO L134 LiptonReduction]: Checked pairs total: 4311 [2023-01-28 07:02:10,507 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-01-28 07:02:10,523 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 07:02:10,528 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;@f726244, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 07:02:10,529 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 07:02:10,536 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2023-01-28 07:02:10,536 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:02:10,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:10,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:10,538 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:02:10,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:10,543 INFO L85 PathProgramCache]: Analyzing trace with hash -733799435, now seen corresponding path program 1 times [2023-01-28 07:02:10,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:10,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996558549] [2023-01-28 07:02:10,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:10,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:10,941 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 07:02:10,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:10,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996558549] [2023-01-28 07:02:10,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996558549] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:10,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:10,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 07:02:10,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083213395] [2023-01-28 07:02:10,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:10,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:02:10,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:10,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:02:10,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:02:10,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 246 [2023-01-28 07:02:10,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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 07:02:10,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:10,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 246 [2023-01-28 07:02:10,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:11,573 INFO L130 PetriNetUnfolder]: 2185/3052 cut-off events. [2023-01-28 07:02:11,573 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2023-01-28 07:02:11,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6238 conditions, 3052 events. 2185/3052 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13281 event pairs, 721 based on Foata normal form. 32/3081 useless extension candidates. Maximal degree in co-relation 6226. Up to 2745 conditions per place. [2023-01-28 07:02:11,621 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 36 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2023-01-28 07:02:11,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 179 flow [2023-01-28 07:02:11,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:02:11,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:02:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-01-28 07:02:11,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5663956639566395 [2023-01-28 07:02:11,636 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-01-28 07:02:11,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-01-28 07:02:11,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:11,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-01-28 07:02:11,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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 07:02:11,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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 07:02:11,656 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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 07:02:11,658 INFO L175 Difference]: Start difference. First operand has 36 places, 23 transitions, 58 flow. Second operand 3 states and 418 transitions. [2023-01-28 07:02:11,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 179 flow [2023-01-28 07:02:11,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 172 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 07:02:11,670 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 73 flow [2023-01-28 07:02:11,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2023-01-28 07:02:11,675 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2023-01-28 07:02:11,675 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 73 flow [2023-01-28 07:02:11,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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 07:02:11,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:11,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:11,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 07:02:11,676 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:02:11,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:11,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1272947893, now seen corresponding path program 1 times [2023-01-28 07:02:11,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:11,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609681016] [2023-01-28 07:02:11,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:11,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:13,059 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 07:02:13,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:13,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609681016] [2023-01-28 07:02:13,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609681016] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:13,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:13,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:02:13,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842008936] [2023-01-28 07:02:13,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:13,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:02:13,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:13,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:02:13,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-01-28 07:02:13,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 246 [2023-01-28 07:02:13,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 73 flow. Second operand has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 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 07:02:13,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:13,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 246 [2023-01-28 07:02:13,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:13,632 INFO L130 PetriNetUnfolder]: 2409/3389 cut-off events. [2023-01-28 07:02:13,632 INFO L131 PetriNetUnfolder]: For 464/464 co-relation queries the response was YES. [2023-01-28 07:02:13,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7572 conditions, 3389 events. 2409/3389 cut-off events. For 464/464 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 14472 event pairs, 614 based on Foata normal form. 20/3408 useless extension candidates. Maximal degree in co-relation 7561. Up to 3007 conditions per place. [2023-01-28 07:02:13,656 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 32 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2023-01-28 07:02:13,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 174 flow [2023-01-28 07:02:13,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:02:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:02:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-01-28 07:02:13,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46883468834688347 [2023-01-28 07:02:13,661 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-01-28 07:02:13,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-01-28 07:02:13,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:13,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-01-28 07:02:13,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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 07:02:13,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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 07:02:13,667 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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 07:02:13,667 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 73 flow. Second operand 3 states and 346 transitions. [2023-01-28 07:02:13,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 174 flow [2023-01-28 07:02:13,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 07:02:13,670 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 89 flow [2023-01-28 07:02:13,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2023-01-28 07:02:13,672 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2023-01-28 07:02:13,672 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 89 flow [2023-01-28 07:02:13,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 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 07:02:13,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:13,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:13,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 07:02:13,673 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:02:13,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:13,676 INFO L85 PathProgramCache]: Analyzing trace with hash -286797414, now seen corresponding path program 1 times [2023-01-28 07:02:13,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:13,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106510295] [2023-01-28 07:02:13,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:13,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:13,950 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 07:02:13,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:13,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106510295] [2023-01-28 07:02:13,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106510295] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:13,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:13,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 07:02:13,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73018683] [2023-01-28 07:02:13,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:13,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:02:13,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:13,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:02:13,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:02:13,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 246 [2023-01-28 07:02:13,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 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 07:02:13,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:13,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 246 [2023-01-28 07:02:13,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:14,455 INFO L130 PetriNetUnfolder]: 2206/3156 cut-off events. [2023-01-28 07:02:14,455 INFO L131 PetriNetUnfolder]: For 858/858 co-relation queries the response was YES. [2023-01-28 07:02:14,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7351 conditions, 3156 events. 2206/3156 cut-off events. For 858/858 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13957 event pairs, 652 based on Foata normal form. 30/3185 useless extension candidates. Maximal degree in co-relation 7338. Up to 2474 conditions per place. [2023-01-28 07:02:14,486 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 33 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2023-01-28 07:02:14,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 192 flow [2023-01-28 07:02:14,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:02:14,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:02:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-01-28 07:02:14,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5650406504065041 [2023-01-28 07:02:14,489 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-01-28 07:02:14,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-01-28 07:02:14,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:14,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-01-28 07:02:14,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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 07:02:14,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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 07:02:14,493 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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 07:02:14,493 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 89 flow. Second operand 3 states and 417 transitions. [2023-01-28 07:02:14,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 192 flow [2023-01-28 07:02:14,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 07:02:14,500 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 94 flow [2023-01-28 07:02:14,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-01-28 07:02:14,501 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2023-01-28 07:02:14,504 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 94 flow [2023-01-28 07:02:14,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 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 07:02:14,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:14,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:14,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 07:02:14,505 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:02:14,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:14,505 INFO L85 PathProgramCache]: Analyzing trace with hash -300766825, now seen corresponding path program 1 times [2023-01-28 07:02:14,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:14,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707106912] [2023-01-28 07:02:14,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:14,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:14,828 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 07:02:14,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:14,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707106912] [2023-01-28 07:02:14,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707106912] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:14,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:14,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:02:14,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161850111] [2023-01-28 07:02:14,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:14,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:02:14,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:14,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:02:14,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:02:14,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 246 [2023-01-28 07:02:14,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:14,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:14,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 246 [2023-01-28 07:02:14,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:15,470 INFO L130 PetriNetUnfolder]: 2772/3904 cut-off events. [2023-01-28 07:02:15,470 INFO L131 PetriNetUnfolder]: For 1491/1491 co-relation queries the response was YES. [2023-01-28 07:02:15,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9528 conditions, 3904 events. 2772/3904 cut-off events. For 1491/1491 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 17368 event pairs, 1957 based on Foata normal form. 40/3943 useless extension candidates. Maximal degree in co-relation 9513. Up to 3406 conditions per place. [2023-01-28 07:02:15,494 INFO L137 encePairwiseOnDemand]: 237/246 looper letters, 29 selfloop transitions, 9 changer transitions 0/40 dead transitions. [2023-01-28 07:02:15,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 204 flow [2023-01-28 07:02:15,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:02:15,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:02:15,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 507 transitions. [2023-01-28 07:02:15,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5152439024390244 [2023-01-28 07:02:15,505 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 507 transitions. [2023-01-28 07:02:15,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 507 transitions. [2023-01-28 07:02:15,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:15,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 507 transitions. [2023-01-28 07:02:15,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 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 07:02:15,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:15,511 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:15,511 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 94 flow. Second operand 4 states and 507 transitions. [2023-01-28 07:02:15,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 204 flow [2023-01-28 07:02:15,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 07:02:15,513 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 144 flow [2023-01-28 07:02:15,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-01-28 07:02:15,515 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2023-01-28 07:02:15,515 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 144 flow [2023-01-28 07:02:15,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:15,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:15,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:15,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 07:02:15,516 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:02:15,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:15,517 INFO L85 PathProgramCache]: Analyzing trace with hash 719305021, now seen corresponding path program 2 times [2023-01-28 07:02:15,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:15,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910900916] [2023-01-28 07:02:15,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:15,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:16,033 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 07:02:16,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:16,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910900916] [2023-01-28 07:02:16,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910900916] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:16,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:16,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:02:16,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347165172] [2023-01-28 07:02:16,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:16,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:02:16,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:16,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:02:16,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:02:16,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 246 [2023-01-28 07:02:16,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 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 07:02:16,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:16,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 246 [2023-01-28 07:02:16,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:16,754 INFO L130 PetriNetUnfolder]: 2838/4017 cut-off events. [2023-01-28 07:02:16,754 INFO L131 PetriNetUnfolder]: For 2895/2895 co-relation queries the response was YES. [2023-01-28 07:02:16,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11522 conditions, 4017 events. 2838/4017 cut-off events. For 2895/2895 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 18610 event pairs, 693 based on Foata normal form. 38/4055 useless extension candidates. Maximal degree in co-relation 11506. Up to 3018 conditions per place. [2023-01-28 07:02:16,791 INFO L137 encePairwiseOnDemand]: 238/246 looper letters, 51 selfloop transitions, 13 changer transitions 0/66 dead transitions. [2023-01-28 07:02:16,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 66 transitions, 402 flow [2023-01-28 07:02:16,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:02:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:02:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2023-01-28 07:02:16,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.516260162601626 [2023-01-28 07:02:16,794 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions. [2023-01-28 07:02:16,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions. [2023-01-28 07:02:16,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:16,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions. [2023-01-28 07:02:16,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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 07:02:16,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:16,798 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:16,798 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 144 flow. Second operand 4 states and 508 transitions. [2023-01-28 07:02:16,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 66 transitions, 402 flow [2023-01-28 07:02:16,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 66 transitions, 381 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 07:02:16,806 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 248 flow [2023-01-28 07:02:16,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=248, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2023-01-28 07:02:16,808 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2023-01-28 07:02:16,808 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 248 flow [2023-01-28 07:02:16,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 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 07:02:16,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:16,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:16,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 07:02:16,809 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:02:16,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:16,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1020378767, now seen corresponding path program 1 times [2023-01-28 07:02:16,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:16,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482797027] [2023-01-28 07:02:16,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:16,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:16,884 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 07:02:16,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:16,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482797027] [2023-01-28 07:02:16,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482797027] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:16,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:16,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:02:16,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235079860] [2023-01-28 07:02:16,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:16,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:02:16,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:16,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:02:16,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:02:16,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 246 [2023-01-28 07:02:16,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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 07:02:16,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:16,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 246 [2023-01-28 07:02:16,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:17,576 INFO L130 PetriNetUnfolder]: 3389/4807 cut-off events. [2023-01-28 07:02:17,576 INFO L131 PetriNetUnfolder]: For 7564/7804 co-relation queries the response was YES. [2023-01-28 07:02:17,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15191 conditions, 4807 events. 3389/4807 cut-off events. For 7564/7804 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 23947 event pairs, 1450 based on Foata normal form. 274/5023 useless extension candidates. Maximal degree in co-relation 15173. Up to 2960 conditions per place. [2023-01-28 07:02:17,602 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 58 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2023-01-28 07:02:17,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 65 transitions, 459 flow [2023-01-28 07:02:17,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:02:17,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:02:17,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-01-28 07:02:17,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5663956639566395 [2023-01-28 07:02:17,604 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-01-28 07:02:17,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-01-28 07:02:17,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:17,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-01-28 07:02:17,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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 07:02:17,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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 07:02:17,608 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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 07:02:17,608 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 248 flow. Second operand 3 states and 418 transitions. [2023-01-28 07:02:17,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 65 transitions, 459 flow [2023-01-28 07:02:17,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 453 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 07:02:17,617 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 253 flow [2023-01-28 07:02:17,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2023-01-28 07:02:17,619 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2023-01-28 07:02:17,620 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 253 flow [2023-01-28 07:02:17,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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 07:02:17,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:17,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:17,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 07:02:17,620 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:02:17,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:17,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1942478915, now seen corresponding path program 1 times [2023-01-28 07:02:17,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:17,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13492070] [2023-01-28 07:02:17,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:17,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:18,016 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 07:02:18,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:18,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13492070] [2023-01-28 07:02:18,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13492070] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:18,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:18,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:02:18,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419917433] [2023-01-28 07:02:18,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:18,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:02:18,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:18,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:02:18,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:02:18,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 246 [2023-01-28 07:02:18,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 253 flow. Second operand has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 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 07:02:18,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:18,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 246 [2023-01-28 07:02:18,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:18,872 INFO L130 PetriNetUnfolder]: 4302/6228 cut-off events. [2023-01-28 07:02:18,872 INFO L131 PetriNetUnfolder]: For 8816/8885 co-relation queries the response was YES. [2023-01-28 07:02:18,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19555 conditions, 6228 events. 4302/6228 cut-off events. For 8816/8885 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 33259 event pairs, 1673 based on Foata normal form. 95/6321 useless extension candidates. Maximal degree in co-relation 19536. Up to 3484 conditions per place. [2023-01-28 07:02:18,902 INFO L137 encePairwiseOnDemand]: 236/246 looper letters, 42 selfloop transitions, 17 changer transitions 3/64 dead transitions. [2023-01-28 07:02:18,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 64 transitions, 459 flow [2023-01-28 07:02:18,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:02:18,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:02:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2023-01-28 07:02:18,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5186991869918699 [2023-01-28 07:02:18,905 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 638 transitions. [2023-01-28 07:02:18,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 638 transitions. [2023-01-28 07:02:18,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:18,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 638 transitions. [2023-01-28 07:02:18,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 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 07:02:18,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 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 07:02:18,911 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 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 07:02:18,911 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 253 flow. Second operand 5 states and 638 transitions. [2023-01-28 07:02:18,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 64 transitions, 459 flow [2023-01-28 07:02:18,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 64 transitions, 448 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-01-28 07:02:18,928 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 284 flow [2023-01-28 07:02:18,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=284, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-01-28 07:02:18,930 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2023-01-28 07:02:18,930 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 284 flow [2023-01-28 07:02:18,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 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 07:02:18,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:18,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:18,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 07:02:18,931 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:02:18,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:18,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1957731907, now seen corresponding path program 1 times [2023-01-28 07:02:18,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:18,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634843599] [2023-01-28 07:02:18,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:18,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:19,227 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 07:02:19,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:19,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634843599] [2023-01-28 07:02:19,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634843599] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:19,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:19,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:02:19,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534393326] [2023-01-28 07:02:19,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:19,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:02:19,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:19,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:02:19,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:02:19,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 246 [2023-01-28 07:02:19,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 284 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 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 07:02:19,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:19,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 246 [2023-01-28 07:02:19,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:20,067 INFO L130 PetriNetUnfolder]: 3578/5365 cut-off events. [2023-01-28 07:02:20,067 INFO L131 PetriNetUnfolder]: For 10991/11225 co-relation queries the response was YES. [2023-01-28 07:02:20,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17110 conditions, 5365 events. 3578/5365 cut-off events. For 10991/11225 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 30567 event pairs, 702 based on Foata normal form. 611/5963 useless extension candidates. Maximal degree in co-relation 17089. Up to 3798 conditions per place. [2023-01-28 07:02:20,093 INFO L137 encePairwiseOnDemand]: 239/246 looper letters, 59 selfloop transitions, 5 changer transitions 40/109 dead transitions. [2023-01-28 07:02:20,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 109 transitions, 898 flow [2023-01-28 07:02:20,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:02:20,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:02:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 670 transitions. [2023-01-28 07:02:20,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5447154471544715 [2023-01-28 07:02:20,096 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 670 transitions. [2023-01-28 07:02:20,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 670 transitions. [2023-01-28 07:02:20,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:20,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 670 transitions. [2023-01-28 07:02:20,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 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 07:02:20,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 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 07:02:20,101 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 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 07:02:20,101 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 284 flow. Second operand 5 states and 670 transitions. [2023-01-28 07:02:20,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 109 transitions, 898 flow [2023-01-28 07:02:20,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 109 transitions, 841 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 07:02:20,115 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 309 flow [2023-01-28 07:02:20,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=309, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2023-01-28 07:02:20,115 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2023-01-28 07:02:20,116 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 309 flow [2023-01-28 07:02:20,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 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 07:02:20,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:20,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:20,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 07:02:20,116 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:02:20,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:20,117 INFO L85 PathProgramCache]: Analyzing trace with hash 559984319, now seen corresponding path program 1 times [2023-01-28 07:02:20,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:20,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849104530] [2023-01-28 07:02:20,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:20,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:20,421 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 07:02:20,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:20,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849104530] [2023-01-28 07:02:20,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849104530] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:20,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:20,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:02:20,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999210908] [2023-01-28 07:02:20,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:20,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:02:20,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:20,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:02:20,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:02:20,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 246 [2023-01-28 07:02:20,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 309 flow. Second operand has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 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 07:02:20,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:20,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 246 [2023-01-28 07:02:20,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:20,969 INFO L130 PetriNetUnfolder]: 2263/3551 cut-off events. [2023-01-28 07:02:20,969 INFO L131 PetriNetUnfolder]: For 8629/8779 co-relation queries the response was YES. [2023-01-28 07:02:20,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14363 conditions, 3551 events. 2263/3551 cut-off events. For 8629/8779 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 20085 event pairs, 253 based on Foata normal form. 465/4003 useless extension candidates. Maximal degree in co-relation 14338. Up to 1621 conditions per place. [2023-01-28 07:02:20,987 INFO L137 encePairwiseOnDemand]: 239/246 looper letters, 73 selfloop transitions, 9 changer transitions 38/125 dead transitions. [2023-01-28 07:02:20,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 125 transitions, 1025 flow [2023-01-28 07:02:21,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:02:21,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:02:21,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 806 transitions. [2023-01-28 07:02:21,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5460704607046071 [2023-01-28 07:02:21,007 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 806 transitions. [2023-01-28 07:02:21,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 806 transitions. [2023-01-28 07:02:21,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:21,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 806 transitions. [2023-01-28 07:02:21,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.33333333333334) internal successors, (806), 6 states have internal predecessors, (806), 0 states have call successors, (0), 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 07:02:21,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 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 07:02:21,011 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 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 07:02:21,011 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 309 flow. Second operand 6 states and 806 transitions. [2023-01-28 07:02:21,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 125 transitions, 1025 flow [2023-01-28 07:02:21,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 125 transitions, 974 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-01-28 07:02:21,039 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 342 flow [2023-01-28 07:02:21,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=342, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2023-01-28 07:02:21,039 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2023-01-28 07:02:21,039 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 342 flow [2023-01-28 07:02:21,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 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 07:02:21,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:21,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:21,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 07:02:21,040 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:02:21,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:21,042 INFO L85 PathProgramCache]: Analyzing trace with hash 798761460, now seen corresponding path program 1 times [2023-01-28 07:02:21,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:21,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304743984] [2023-01-28 07:02:21,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:21,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:21,316 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 07:02:21,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:21,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304743984] [2023-01-28 07:02:21,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304743984] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:21,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:21,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 07:02:21,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753053534] [2023-01-28 07:02:21,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:21,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:02:21,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:21,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:02:21,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 07:02:21,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 246 [2023-01-28 07:02:21,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 342 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 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 07:02:21,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:21,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 246 [2023-01-28 07:02:21,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:21,763 INFO L130 PetriNetUnfolder]: 1378/2224 cut-off events. [2023-01-28 07:02:21,764 INFO L131 PetriNetUnfolder]: For 5762/5865 co-relation queries the response was YES. [2023-01-28 07:02:21,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9855 conditions, 2224 events. 1378/2224 cut-off events. For 5762/5865 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11970 event pairs, 152 based on Foata normal form. 258/2469 useless extension candidates. Maximal degree in co-relation 9827. Up to 989 conditions per place. [2023-01-28 07:02:21,774 INFO L137 encePairwiseOnDemand]: 239/246 looper letters, 81 selfloop transitions, 13 changer transitions 33/132 dead transitions. [2023-01-28 07:02:21,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 132 transitions, 1121 flow [2023-01-28 07:02:21,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 07:02:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 07:02:21,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 940 transitions. [2023-01-28 07:02:21,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5458768873403019 [2023-01-28 07:02:21,777 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 940 transitions. [2023-01-28 07:02:21,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 940 transitions. [2023-01-28 07:02:21,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:21,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 940 transitions. [2023-01-28 07:02:21,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.28571428571428) internal successors, (940), 7 states have internal predecessors, (940), 0 states have call successors, (0), 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 07:02:21,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 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 07:02:21,782 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 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 07:02:21,782 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 342 flow. Second operand 7 states and 940 transitions. [2023-01-28 07:02:21,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 132 transitions, 1121 flow [2023-01-28 07:02:21,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 132 transitions, 1055 flow, removed 28 selfloop flow, removed 4 redundant places. [2023-01-28 07:02:21,818 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 372 flow [2023-01-28 07:02:21,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=372, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2023-01-28 07:02:21,820 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2023-01-28 07:02:21,820 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 372 flow [2023-01-28 07:02:21,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 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 07:02:21,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:21,822 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 07:02:21,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 07:02:21,822 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:02:21,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:21,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1091520018, now seen corresponding path program 1 times [2023-01-28 07:02:21,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:21,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328023040] [2023-01-28 07:02:21,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:21,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:22,193 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 07:02:22,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:22,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328023040] [2023-01-28 07:02:22,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328023040] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:22,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:22,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 07:02:22,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726178391] [2023-01-28 07:02:22,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:22,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 07:02:22,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:22,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 07:02:22,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-28 07:02:22,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 246 [2023-01-28 07:02:22,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 372 flow. Second operand has 7 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:22,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:22,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 246 [2023-01-28 07:02:22,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:22,530 INFO L130 PetriNetUnfolder]: 1063/1691 cut-off events. [2023-01-28 07:02:22,530 INFO L131 PetriNetUnfolder]: For 4016/4103 co-relation queries the response was YES. [2023-01-28 07:02:22,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7185 conditions, 1691 events. 1063/1691 cut-off events. For 4016/4103 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8585 event pairs, 141 based on Foata normal form. 118/1797 useless extension candidates. Maximal degree in co-relation 7156. Up to 635 conditions per place. [2023-01-28 07:02:22,538 INFO L137 encePairwiseOnDemand]: 239/246 looper letters, 64 selfloop transitions, 17 changer transitions 28/112 dead transitions. [2023-01-28 07:02:22,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 112 transitions, 958 flow [2023-01-28 07:02:22,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 07:02:22,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 07:02:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1052 transitions. [2023-01-28 07:02:22,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5345528455284553 [2023-01-28 07:02:22,542 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1052 transitions. [2023-01-28 07:02:22,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1052 transitions. [2023-01-28 07:02:22,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:22,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1052 transitions. [2023-01-28 07:02:22,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.5) internal successors, (1052), 8 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:22,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 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 07:02:22,548 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 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 07:02:22,548 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 372 flow. Second operand 8 states and 1052 transitions. [2023-01-28 07:02:22,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 112 transitions, 958 flow [2023-01-28 07:02:22,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 112 transitions, 880 flow, removed 27 selfloop flow, removed 6 redundant places. [2023-01-28 07:02:22,591 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 332 flow [2023-01-28 07:02:22,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=332, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2023-01-28 07:02:22,592 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 27 predicate places. [2023-01-28 07:02:22,592 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 332 flow [2023-01-28 07:02:22,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:22,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:22,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:22,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 07:02:22,594 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:02:22,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:22,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1476223431, now seen corresponding path program 1 times [2023-01-28 07:02:22,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:22,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064383323] [2023-01-28 07:02:22,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:22,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:23,190 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 07:02:23,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:23,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064383323] [2023-01-28 07:02:23,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064383323] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:23,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:23,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:02:23,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830419125] [2023-01-28 07:02:23,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:23,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:02:23,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:23,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:02:23,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:02:23,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 246 [2023-01-28 07:02:23,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 332 flow. Second operand has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 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 07:02:23,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:23,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 246 [2023-01-28 07:02:23,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:23,387 INFO L130 PetriNetUnfolder]: 696/1129 cut-off events. [2023-01-28 07:02:23,387 INFO L131 PetriNetUnfolder]: For 2801/2829 co-relation queries the response was YES. [2023-01-28 07:02:23,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4749 conditions, 1129 events. 696/1129 cut-off events. For 2801/2829 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5110 event pairs, 98 based on Foata normal form. 28/1156 useless extension candidates. Maximal degree in co-relation 4720. Up to 554 conditions per place. [2023-01-28 07:02:23,392 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 49 selfloop transitions, 3 changer transitions 40/93 dead transitions. [2023-01-28 07:02:23,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 93 transitions, 850 flow [2023-01-28 07:02:23,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:02:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:02:23,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 531 transitions. [2023-01-28 07:02:23,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396341463414634 [2023-01-28 07:02:23,395 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 531 transitions. [2023-01-28 07:02:23,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 531 transitions. [2023-01-28 07:02:23,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:23,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 531 transitions. [2023-01-28 07:02:23,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 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 07:02:23,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:23,398 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:23,398 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 332 flow. Second operand 4 states and 531 transitions. [2023-01-28 07:02:23,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 93 transitions, 850 flow [2023-01-28 07:02:23,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 93 transitions, 698 flow, removed 42 selfloop flow, removed 11 redundant places. [2023-01-28 07:02:23,410 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 220 flow [2023-01-28 07:02:23,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-01-28 07:02:23,410 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2023-01-28 07:02:23,411 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 220 flow [2023-01-28 07:02:23,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 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 07:02:23,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:23,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:23,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 07:02:23,411 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:02:23,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:23,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1913891627, now seen corresponding path program 2 times [2023-01-28 07:02:23,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:23,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935327013] [2023-01-28 07:02:23,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:23,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:02:23,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 07:02:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:02:23,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 07:02:23,640 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 07:02:23,641 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 07:02:23,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-01-28 07:02:23,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 07:02:23,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 07:02:23,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-01-28 07:02:23,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 07:02:23,644 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:23,650 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 07:02:23,650 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 07:02:23,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 07:02:23 BasicIcfg [2023-01-28 07:02:23,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 07:02:23,762 INFO L158 Benchmark]: Toolchain (without parser) took 24043.20ms. Allocated memory was 339.7MB in the beginning and 918.6MB in the end (delta: 578.8MB). Free memory was 289.4MB in the beginning and 544.9MB in the end (delta: -255.5MB). Peak memory consumption was 323.7MB. Max. memory is 16.0GB. [2023-01-28 07:02:23,762 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 339.7MB. Free memory is still 289.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 07:02:23,762 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.64ms. Allocated memory is still 339.7MB. Free memory was 289.4MB in the beginning and 264.8MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 07:02:23,762 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.62ms. Allocated memory is still 339.7MB. Free memory was 264.8MB in the beginning and 261.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 07:02:23,762 INFO L158 Benchmark]: Boogie Preprocessor took 58.88ms. Allocated memory is still 339.7MB. Free memory was 261.8MB in the beginning and 259.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 07:02:23,763 INFO L158 Benchmark]: RCFGBuilder took 1050.34ms. Allocated memory was 339.7MB in the beginning and 507.5MB in the end (delta: 167.8MB). Free memory was 259.7MB in the beginning and 412.4MB in the end (delta: -152.7MB). Peak memory consumption was 22.5MB. Max. memory is 16.0GB. [2023-01-28 07:02:23,763 INFO L158 Benchmark]: TraceAbstraction took 22305.40ms. Allocated memory was 507.5MB in the beginning and 918.6MB in the end (delta: 411.0MB). Free memory was 411.1MB in the beginning and 544.9MB in the end (delta: -133.8MB). Peak memory consumption was 276.0MB. Max. memory is 16.0GB. [2023-01-28 07:02:23,764 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.12ms. Allocated memory is still 339.7MB. Free memory is still 289.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 539.64ms. Allocated memory is still 339.7MB. Free memory was 289.4MB in the beginning and 264.8MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 82.62ms. Allocated memory is still 339.7MB. Free memory was 264.8MB in the beginning and 261.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 58.88ms. Allocated memory is still 339.7MB. Free memory was 261.8MB in the beginning and 259.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1050.34ms. Allocated memory was 339.7MB in the beginning and 507.5MB in the end (delta: 167.8MB). Free memory was 259.7MB in the beginning and 412.4MB in the end (delta: -152.7MB). Peak memory consumption was 22.5MB. Max. memory is 16.0GB. * TraceAbstraction took 22305.40ms. Allocated memory was 507.5MB in the beginning and 918.6MB in the end (delta: 411.0MB). Free memory was 411.1MB in the beginning and 544.9MB in the end (delta: -133.8MB). Peak memory consumption was 276.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.8s, 136 PlacesBefore, 36 PlacesAfterwards, 124 TransitionsBefore, 23 TransitionsAfterwards, 1736 CoEnabledTransitionPairs, 8 FixpointIterations, 60 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 104 TotalNumberOfCompositions, 4311 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1701, independent: 1509, independent conditional: 0, independent unconditional: 1509, dependent: 192, dependent conditional: 0, dependent unconditional: 192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 877, independent: 838, independent conditional: 0, independent unconditional: 838, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1701, independent: 671, independent conditional: 0, independent unconditional: 671, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 877, unknown conditional: 0, unknown unconditional: 877] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p2_EAX = 0; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff0_thd4; [L747] 0 _Bool y$r_buff1_thd0; [L748] 0 _Bool y$r_buff1_thd1; [L749] 0 _Bool y$r_buff1_thd2; [L750] 0 _Bool y$r_buff1_thd3; [L751] 0 _Bool y$r_buff1_thd4; [L752] 0 _Bool y$read_delayed; [L753] 0 int *y$read_delayed_var; [L754] 0 int y$w_buff0; [L755] 0 _Bool y$w_buff0_used; [L756] 0 int y$w_buff1; [L757] 0 _Bool y$w_buff1_used; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice1; [L760] 0 _Bool weak$$choice2; [L851] 0 pthread_t t2161; [L852] FCALL, FORK 0 pthread_create(&t2161, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2161, ((void *)0), P0, ((void *)0))=-3, t2161={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 y$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(y) [L767] 1 y$mem_tmp = y [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] EXPR 1 \read(y) [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L769] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L770] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L771] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L772] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L774] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L777] EXPR 1 \read(y) [L777] 1 __unbuffered_p0_EAX = y [L778] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L778] EXPR 1 \read(y) [L778] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L778] 1 y = y$flush_delayed ? y$mem_tmp : y [L779] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] 0 pthread_t t2162; [L854] FCALL, FORK 0 pthread_create(&t2162, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2162, ((void *)0), P1, ((void *)0))=-2, t2161={7:0}, t2162={8:0}, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] 0 pthread_t t2163; [L856] FCALL, FORK 0 pthread_create(&t2163, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2163, ((void *)0), P2, ((void *)0))=-1, t2161={7:0}, t2162={8:0}, t2163={9:0}, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] 0 pthread_t t2164; [L858] FCALL, FORK 0 pthread_create(&t2164, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2164, ((void *)0), P3, ((void *)0))=0, t2161={7:0}, t2162={8:0}, t2163={9:0}, t2164={5:0}, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L782] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L794] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L806] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, 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$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L809] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, 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$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 \read(y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, 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$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L826] 4 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, 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$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 \read(y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, 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$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 \read(y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, 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=1, main$tmp_guard1=0, t2161={7:0}, t2162={8:0}, t2163={9:0}, t2164={5:0}, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(y) [L874] 0 y$mem_tmp = y [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] EXPR 0 \read(y) [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 x == 2 && y == 2 [L884] EXPR 0 \read(y) [L884] EXPR 0 x == 2 && y == 2 [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] EXPR 0 \read(y) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] 0 y = y$flush_delayed ? y$mem_tmp : y [L886] 0 y$flush_delayed = (_Bool)0 [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 854]: 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: 852]: 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: 858]: 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: 856]: 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, 173 locations, 5 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: 22.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 288 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 938 IncrementalHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 6 mSDtfsCounter, 938 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=372occurred in iteration=10, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 1426 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 07:02:23,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...