/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/mix043.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:56:29,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:56:29,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:56:29,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:56:29,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:56:29,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:56:29,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:56:29,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:56:29,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:56:29,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:56:29,031 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:56:29,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:56:29,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:56:29,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:56:29,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:56:29,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:56:29,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:56:29,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:56:29,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:56:29,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:56:29,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:56:29,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:56:29,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:56:29,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:56:29,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:56:29,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:56:29,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:56:29,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:56:29,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:56:29,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:56:29,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:56:29,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:56:29,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:56:29,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:56:29,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:56:29,047 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:56:29,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:56:29,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:56:29,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:56:29,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:56:29,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:56:29,049 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 06:56:29,061 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:56:29,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:56:29,062 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:56:29,062 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:56:29,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:56:29,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:56:29,062 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:56:29,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:56:29,063 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:56:29,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:56:29,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:56:29,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:56:29,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:56:29,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:56:29,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:56:29,063 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:56:29,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:56:29,063 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:56:29,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:56:29,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:56:29,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:56:29,064 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:56:29,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:56:29,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:56:29,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:56:29,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:56:29,064 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:56:29,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:56:29,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:56:29,064 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:56:29,065 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:56:29,065 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 06:56:29,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:56:29,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:56:29,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:56:29,255 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:56:29,256 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:56:29,257 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2023-01-28 06:56:30,356 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:56:30,480 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:56:30,481 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2023-01-28 06:56:30,492 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2b2b27cc/80f083e869004d0aabd5f390d9a652b8/FLAG2ecca4339 [2023-01-28 06:56:30,501 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2b2b27cc/80f083e869004d0aabd5f390d9a652b8 [2023-01-28 06:56:30,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:56:30,504 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:56:30,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:56:30,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:56:30,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:56:30,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:56:30" (1/1) ... [2023-01-28 06:56:30,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2152f8ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:30, skipping insertion in model container [2023-01-28 06:56:30,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:56:30" (1/1) ... [2023-01-28 06:56:30,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:56:30,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:56:30,674 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/mix043.oepc.i[945,958] [2023-01-28 06:56:30,835 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:56:30,846 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:56:30,854 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/mix043.oepc.i[945,958] [2023-01-28 06:56:30,907 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:56:30,932 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:56:30,932 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:56:30,936 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:56:30,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:30 WrapperNode [2023-01-28 06:56:30,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:56:30,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:56:30,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:56:30,938 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:56:30,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:30" (1/1) ... [2023-01-28 06:56:30,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:30" (1/1) ... [2023-01-28 06:56:30,990 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-01-28 06:56:30,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:56:30,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:56:30,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:56:30,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:56:30,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:30" (1/1) ... [2023-01-28 06:56:30,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:30" (1/1) ... [2023-01-28 06:56:31,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:30" (1/1) ... [2023-01-28 06:56:31,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:30" (1/1) ... [2023-01-28 06:56:31,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:30" (1/1) ... [2023-01-28 06:56:31,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:30" (1/1) ... [2023-01-28 06:56:31,023 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:30" (1/1) ... [2023-01-28 06:56:31,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:30" (1/1) ... [2023-01-28 06:56:31,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:56:31,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:56:31,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:56:31,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:56:31,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:30" (1/1) ... [2023-01-28 06:56:31,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:56:31,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:56:31,052 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 06:56:31,076 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 06:56:31,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:56:31,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:56:31,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:56:31,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:56:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:56:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:56:31,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:56:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:56:31,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:56:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 06:56:31,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 06:56:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-28 06:56:31,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-28 06:56:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:56:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:56:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:56:31,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:56:31,087 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 06:56:31,230 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:56:31,231 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:56:31,534 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:56:31,704 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:56:31,704 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:56:31,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:56:31 BoogieIcfgContainer [2023-01-28 06:56:31,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:56:31,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:56:31,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:56:31,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:56:31,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:56:30" (1/3) ... [2023-01-28 06:56:31,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a1ee42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:56:31, skipping insertion in model container [2023-01-28 06:56:31,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:30" (2/3) ... [2023-01-28 06:56:31,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a1ee42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:56:31, skipping insertion in model container [2023-01-28 06:56:31,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:56:31" (3/3) ... [2023-01-28 06:56:31,711 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.oepc.i [2023-01-28 06:56:31,722 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:56:31,723 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:56:31,723 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:56:31,761 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:56:31,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2023-01-28 06:56:31,819 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2023-01-28 06:56:31,819 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:56:31,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-28 06:56:31,824 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2023-01-28 06:56:31,827 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2023-01-28 06:56:31,829 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:56:31,835 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2023-01-28 06:56:31,837 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2023-01-28 06:56:31,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2023-01-28 06:56:31,859 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2023-01-28 06:56:31,859 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:56:31,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-28 06:56:31,861 INFO L119 LiptonReduction]: Number of co-enabled transitions 3270 [2023-01-28 06:56:34,703 INFO L134 LiptonReduction]: Checked pairs total: 8894 [2023-01-28 06:56:34,703 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-01-28 06:56:34,713 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:56:34,717 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;@3887c3ff, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:56:34,717 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-28 06:56:34,719 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-28 06:56:34,719 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:56:34,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:34,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 06:56:34,720 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:34,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:34,724 INFO L85 PathProgramCache]: Analyzing trace with hash 553531, now seen corresponding path program 1 times [2023-01-28 06:56:34,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:34,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625278879] [2023-01-28 06:56:34,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:34,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:35,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:35,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625278879] [2023-01-28 06:56:35,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625278879] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:35,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:35,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:56:35,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089023324] [2023-01-28 06:56:35,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:35,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:56:35,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:35,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:56:35,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:56:35,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 242 [2023-01-28 06:56:35,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states 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 06:56:35,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:35,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 242 [2023-01-28 06:56:35,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:35,826 INFO L130 PetriNetUnfolder]: 5879/8109 cut-off events. [2023-01-28 06:56:35,827 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2023-01-28 06:56:35,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16253 conditions, 8109 events. 5879/8109 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 40514 event pairs, 2239 based on Foata normal form. 0/7719 useless extension candidates. Maximal degree in co-relation 16241. Up to 6367 conditions per place. [2023-01-28 06:56:35,858 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-01-28 06:56:35,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 215 flow [2023-01-28 06:56:35,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:56:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:56:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-01-28 06:56:35,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5523415977961432 [2023-01-28 06:56:35,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-01-28 06:56:35,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-01-28 06:56:35,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:35,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-01-28 06:56:35,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states 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 06:56:35,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:35,885 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:35,886 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 401 transitions. [2023-01-28 06:56:35,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 215 flow [2023-01-28 06:56:35,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 06:56:35,890 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-01-28 06:56:35,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-01-28 06:56:35,895 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-01-28 06:56:35,895 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-01-28 06:56:35,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states 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 06:56:35,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:35,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:35,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:56:35,896 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:35,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:35,898 INFO L85 PathProgramCache]: Analyzing trace with hash 276887586, now seen corresponding path program 1 times [2023-01-28 06:56:35,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:35,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22199646] [2023-01-28 06:56:35,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:35,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:36,182 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 06:56:36,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:36,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22199646] [2023-01-28 06:56:36,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22199646] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:36,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:36,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:56:36,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045333434] [2023-01-28 06:56:36,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:36,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:56:36,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:36,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:56:36,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:56:36,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242 [2023-01-28 06:56:36,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states 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 06:56:36,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:36,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242 [2023-01-28 06:56:36,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:36,754 INFO L130 PetriNetUnfolder]: 5847/7940 cut-off events. [2023-01-28 06:56:36,754 INFO L131 PetriNetUnfolder]: For 521/521 co-relation queries the response was YES. [2023-01-28 06:56:36,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16604 conditions, 7940 events. 5847/7940 cut-off events. For 521/521 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 38042 event pairs, 1383 based on Foata normal form. 32/7967 useless extension candidates. Maximal degree in co-relation 16594. Up to 7393 conditions per place. [2023-01-28 06:56:36,793 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 36 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2023-01-28 06:56:36,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 176 flow [2023-01-28 06:56:36,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:56:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:56:36,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-01-28 06:56:36,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5261707988980716 [2023-01-28 06:56:36,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-01-28 06:56:36,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-01-28 06:56:36,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:36,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-01-28 06:56:36,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states 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 06:56:36,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:36,798 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:36,798 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 382 transitions. [2023-01-28 06:56:36,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 176 flow [2023-01-28 06:56:36,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:56:36,800 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 83 flow [2023-01-28 06:56:36,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-01-28 06:56:36,801 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-01-28 06:56:36,801 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 83 flow [2023-01-28 06:56:36,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states 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 06:56:36,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:36,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:36,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:56:36,802 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:36,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:36,804 INFO L85 PathProgramCache]: Analyzing trace with hash -6421539, now seen corresponding path program 1 times [2023-01-28 06:56:36,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:36,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239164659] [2023-01-28 06:56:36,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:36,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:36,999 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 06:56:36,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:36,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239164659] [2023-01-28 06:56:36,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239164659] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:37,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:37,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:56:37,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197242839] [2023-01-28 06:56:37,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:37,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:56:37,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:37,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:56:37,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:56:37,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-01-28 06:56:37,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states 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 06:56:37,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:37,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-01-28 06:56:37,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:38,063 INFO L130 PetriNetUnfolder]: 11809/16070 cut-off events. [2023-01-28 06:56:38,063 INFO L131 PetriNetUnfolder]: For 1485/1485 co-relation queries the response was YES. [2023-01-28 06:56:38,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34207 conditions, 16070 events. 11809/16070 cut-off events. For 1485/1485 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 78459 event pairs, 2914 based on Foata normal form. 500/16570 useless extension candidates. Maximal degree in co-relation 34196. Up to 8556 conditions per place. [2023-01-28 06:56:38,133 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 53 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2023-01-28 06:56:38,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 261 flow [2023-01-28 06:56:38,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:56:38,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:56:38,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-01-28 06:56:38,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503099173553719 [2023-01-28 06:56:38,134 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-01-28 06:56:38,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-01-28 06:56:38,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:38,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-01-28 06:56:38,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states 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 06:56:38,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:38,137 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:38,137 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 83 flow. Second operand 4 states and 487 transitions. [2023-01-28 06:56:38,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 59 transitions, 261 flow [2023-01-28 06:56:38,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:56:38,140 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 126 flow [2023-01-28 06:56:38,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-01-28 06:56:38,141 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-01-28 06:56:38,143 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 126 flow [2023-01-28 06:56:38,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states 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 06:56:38,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:38,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:38,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:56:38,144 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:38,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:38,144 INFO L85 PathProgramCache]: Analyzing trace with hash -269327850, now seen corresponding path program 1 times [2023-01-28 06:56:38,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:38,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24684189] [2023-01-28 06:56:38,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:38,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:38,294 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 06:56:38,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:38,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24684189] [2023-01-28 06:56:38,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24684189] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:38,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:38,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:56:38,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900962184] [2023-01-28 06:56:38,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:38,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:56:38,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:38,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:56:38,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:56:38,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-01-28 06:56:38,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states 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 06:56:38,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:38,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-01-28 06:56:38,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:39,067 INFO L130 PetriNetUnfolder]: 7412/10761 cut-off events. [2023-01-28 06:56:39,068 INFO L131 PetriNetUnfolder]: For 3608/3715 co-relation queries the response was YES. [2023-01-28 06:56:39,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24832 conditions, 10761 events. 7412/10761 cut-off events. For 3608/3715 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 63382 event pairs, 1363 based on Foata normal form. 821/11216 useless extension candidates. Maximal degree in co-relation 24817. Up to 6780 conditions per place. [2023-01-28 06:56:39,107 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 72 selfloop transitions, 10 changer transitions 0/89 dead transitions. [2023-01-28 06:56:39,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 89 transitions, 448 flow [2023-01-28 06:56:39,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:56:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:56:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2023-01-28 06:56:39,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2023-01-28 06:56:39,109 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 616 transitions. [2023-01-28 06:56:39,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 616 transitions. [2023-01-28 06:56:39,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:39,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 616 transitions. [2023-01-28 06:56:39,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states 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 06:56:39,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:39,112 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:39,113 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 126 flow. Second operand 5 states and 616 transitions. [2023-01-28 06:56:39,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 89 transitions, 448 flow [2023-01-28 06:56:39,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 89 transitions, 443 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:56:39,118 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 199 flow [2023-01-28 06:56:39,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-01-28 06:56:39,119 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2023-01-28 06:56:39,119 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 199 flow [2023-01-28 06:56:39,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states 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 06:56:39,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:39,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:39,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:56:39,120 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:39,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:39,120 INFO L85 PathProgramCache]: Analyzing trace with hash -39621490, now seen corresponding path program 1 times [2023-01-28 06:56:39,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:39,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476562929] [2023-01-28 06:56:39,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:39,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:39,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:39,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476562929] [2023-01-28 06:56:39,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476562929] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:39,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:39,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:56:39,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698082639] [2023-01-28 06:56:39,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:39,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:56:39,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:39,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:56:39,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:56:39,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-01-28 06:56:39,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states 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 06:56:39,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:39,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-01-28 06:56:39,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:40,090 INFO L130 PetriNetUnfolder]: 5864/8745 cut-off events. [2023-01-28 06:56:40,090 INFO L131 PetriNetUnfolder]: For 5144/5180 co-relation queries the response was YES. [2023-01-28 06:56:40,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25646 conditions, 8745 events. 5864/8745 cut-off events. For 5144/5180 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 52624 event pairs, 717 based on Foata normal form. 527/8997 useless extension candidates. Maximal degree in co-relation 25627. Up to 2675 conditions per place. [2023-01-28 06:56:40,123 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 100 selfloop transitions, 19 changer transitions 0/126 dead transitions. [2023-01-28 06:56:40,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 126 transitions, 728 flow [2023-01-28 06:56:40,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:56:40,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:56:40,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 865 transitions. [2023-01-28 06:56:40,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106257378984652 [2023-01-28 06:56:40,125 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 865 transitions. [2023-01-28 06:56:40,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 865 transitions. [2023-01-28 06:56:40,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:40,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 865 transitions. [2023-01-28 06:56:40,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.57142857142857) internal successors, (865), 7 states have internal predecessors, (865), 0 states have call successors, (0), 0 states 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 06:56:40,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:40,130 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:40,130 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 199 flow. Second operand 7 states and 865 transitions. [2023-01-28 06:56:40,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 126 transitions, 728 flow [2023-01-28 06:56:40,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 126 transitions, 723 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:56:40,157 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 328 flow [2023-01-28 06:56:40,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=328, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-01-28 06:56:40,159 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2023-01-28 06:56:40,159 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 328 flow [2023-01-28 06:56:40,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states 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 06:56:40,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:40,159 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 06:56:40,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:56:40,159 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:40,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:40,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1029788051, now seen corresponding path program 1 times [2023-01-28 06:56:40,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:40,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467477027] [2023-01-28 06:56:40,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:40,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:40,425 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 06:56:40,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:40,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467477027] [2023-01-28 06:56:40,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467477027] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:40,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:40,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:56:40,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039998511] [2023-01-28 06:56:40,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:40,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:56:40,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:40,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:56:40,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:56:40,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-01-28 06:56:40,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 328 flow. Second operand has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states 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 06:56:40,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:40,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-01-28 06:56:40,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:41,189 INFO L130 PetriNetUnfolder]: 5391/8033 cut-off events. [2023-01-28 06:56:41,189 INFO L131 PetriNetUnfolder]: For 10341/10363 co-relation queries the response was YES. [2023-01-28 06:56:41,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27497 conditions, 8033 events. 5391/8033 cut-off events. For 10341/10363 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 48095 event pairs, 604 based on Foata normal form. 191/7966 useless extension candidates. Maximal degree in co-relation 27474. Up to 2537 conditions per place. [2023-01-28 06:56:41,223 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 111 selfloop transitions, 28 changer transitions 13/159 dead transitions. [2023-01-28 06:56:41,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 159 transitions, 1045 flow [2023-01-28 06:56:41,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:56:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:56:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1112 transitions. [2023-01-28 06:56:41,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5105601469237833 [2023-01-28 06:56:41,226 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1112 transitions. [2023-01-28 06:56:41,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1112 transitions. [2023-01-28 06:56:41,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:41,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1112 transitions. [2023-01-28 06:56:41,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.55555555555556) internal successors, (1112), 9 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states 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 06:56:41,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:41,230 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:41,231 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 328 flow. Second operand 9 states and 1112 transitions. [2023-01-28 06:56:41,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 159 transitions, 1045 flow [2023-01-28 06:56:41,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 159 transitions, 995 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-01-28 06:56:41,447 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 456 flow [2023-01-28 06:56:41,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=456, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2023-01-28 06:56:41,448 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2023-01-28 06:56:41,448 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 456 flow [2023-01-28 06:56:41,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states 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 06:56:41,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:41,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:41,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:56:41,449 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:41,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:41,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2143376969, now seen corresponding path program 1 times [2023-01-28 06:56:41,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:41,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756048680] [2023-01-28 06:56:41,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:41,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:41,635 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 06:56:41,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:41,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756048680] [2023-01-28 06:56:41,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756048680] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:41,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:41,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:56:41,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155835551] [2023-01-28 06:56:41,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:41,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:56:41,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:41,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:56:41,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:56:41,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-01-28 06:56:41,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 456 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states 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 06:56:41,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:41,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-01-28 06:56:41,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:43,071 INFO L130 PetriNetUnfolder]: 12166/17683 cut-off events. [2023-01-28 06:56:43,071 INFO L131 PetriNetUnfolder]: For 44182/44182 co-relation queries the response was YES. [2023-01-28 06:56:43,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63800 conditions, 17683 events. 12166/17683 cut-off events. For 44182/44182 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 105266 event pairs, 1571 based on Foata normal form. 13/17696 useless extension candidates. Maximal degree in co-relation 63774. Up to 6752 conditions per place. [2023-01-28 06:56:43,133 INFO L137 encePairwiseOnDemand]: 233/242 looper letters, 114 selfloop transitions, 22 changer transitions 109/245 dead transitions. [2023-01-28 06:56:43,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 245 transitions, 2342 flow [2023-01-28 06:56:43,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:56:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:56:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions. [2023-01-28 06:56:43,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117079889807162 [2023-01-28 06:56:43,135 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 743 transitions. [2023-01-28 06:56:43,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 743 transitions. [2023-01-28 06:56:43,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:43,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 743 transitions. [2023-01-28 06:56:43,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states 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 06:56:43,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states 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 06:56:43,138 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states 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 06:56:43,138 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 456 flow. Second operand 6 states and 743 transitions. [2023-01-28 06:56:43,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 245 transitions, 2342 flow [2023-01-28 06:56:43,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 245 transitions, 1905 flow, removed 154 selfloop flow, removed 4 redundant places. [2023-01-28 06:56:43,824 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 431 flow [2023-01-28 06:56:43,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=431, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2023-01-28 06:56:43,825 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2023-01-28 06:56:43,825 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 431 flow [2023-01-28 06:56:43,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states 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 06:56:43,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:43,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:43,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:56:43,825 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:43,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:43,826 INFO L85 PathProgramCache]: Analyzing trace with hash 178661929, now seen corresponding path program 2 times [2023-01-28 06:56:43,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:43,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836954400] [2023-01-28 06:56:43,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:43,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:44,254 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 06:56:44,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:44,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836954400] [2023-01-28 06:56:44,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836954400] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:44,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:44,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:56:44,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524253278] [2023-01-28 06:56:44,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:44,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:56:44,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:44,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:56:44,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:56:44,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 242 [2023-01-28 06:56:44,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 61 transitions, 431 flow. Second operand has 6 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 0 states 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 06:56:44,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:44,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 242 [2023-01-28 06:56:44,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:44,988 INFO L130 PetriNetUnfolder]: 5150/8331 cut-off events. [2023-01-28 06:56:44,991 INFO L131 PetriNetUnfolder]: For 13750/13820 co-relation queries the response was YES. [2023-01-28 06:56:45,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28661 conditions, 8331 events. 5150/8331 cut-off events. For 13750/13820 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 54528 event pairs, 1273 based on Foata normal form. 33/8298 useless extension candidates. Maximal degree in co-relation 28629. Up to 4232 conditions per place. [2023-01-28 06:56:45,037 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 108 selfloop transitions, 9 changer transitions 55/186 dead transitions. [2023-01-28 06:56:45,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 186 transitions, 1572 flow [2023-01-28 06:56:45,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:56:45,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:56:45,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 859 transitions. [2023-01-28 06:56:45,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070838252656434 [2023-01-28 06:56:45,040 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 859 transitions. [2023-01-28 06:56:45,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 859 transitions. [2023-01-28 06:56:45,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:45,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 859 transitions. [2023-01-28 06:56:45,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.71428571428571) internal successors, (859), 7 states have internal predecessors, (859), 0 states have call successors, (0), 0 states 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 06:56:45,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:45,046 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:45,046 INFO L175 Difference]: Start difference. First operand has 73 places, 61 transitions, 431 flow. Second operand 7 states and 859 transitions. [2023-01-28 06:56:45,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 186 transitions, 1572 flow [2023-01-28 06:56:45,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 186 transitions, 1490 flow, removed 41 selfloop flow, removed 5 redundant places. [2023-01-28 06:56:45,166 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 474 flow [2023-01-28 06:56:45,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=474, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2023-01-28 06:56:45,167 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2023-01-28 06:56:45,167 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 474 flow [2023-01-28 06:56:45,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 0 states 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 06:56:45,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:45,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:45,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:56:45,175 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:45,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:45,176 INFO L85 PathProgramCache]: Analyzing trace with hash -852883781, now seen corresponding path program 3 times [2023-01-28 06:56:45,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:45,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625878722] [2023-01-28 06:56:45,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:45,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:45,771 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 06:56:45,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:45,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625878722] [2023-01-28 06:56:45,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625878722] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:45,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:45,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:56:45,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507426995] [2023-01-28 06:56:45,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:45,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:56:45,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:45,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:56:45,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:56:45,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 242 [2023-01-28 06:56:45,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 474 flow. Second operand has 7 states, 7 states have (on average 105.42857142857143) internal successors, (738), 7 states have internal predecessors, (738), 0 states have call successors, (0), 0 states 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 06:56:45,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:45,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 242 [2023-01-28 06:56:45,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:47,019 INFO L130 PetriNetUnfolder]: 8353/12895 cut-off events. [2023-01-28 06:56:47,020 INFO L131 PetriNetUnfolder]: For 27417/27417 co-relation queries the response was YES. [2023-01-28 06:56:47,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50411 conditions, 12895 events. 8353/12895 cut-off events. For 27417/27417 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 80918 event pairs, 841 based on Foata normal form. 12/12907 useless extension candidates. Maximal degree in co-relation 50379. Up to 4301 conditions per place. [2023-01-28 06:56:47,066 INFO L137 encePairwiseOnDemand]: 228/242 looper letters, 217 selfloop transitions, 74 changer transitions 26/317 dead transitions. [2023-01-28 06:56:47,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 317 transitions, 2686 flow [2023-01-28 06:56:47,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:56:47,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:56:47,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1093 transitions. [2023-01-28 06:56:47,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5018365472910927 [2023-01-28 06:56:47,069 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1093 transitions. [2023-01-28 06:56:47,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1093 transitions. [2023-01-28 06:56:47,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:47,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1093 transitions. [2023-01-28 06:56:47,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.44444444444444) internal successors, (1093), 9 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states 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 06:56:47,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:47,075 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:47,075 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 474 flow. Second operand 9 states and 1093 transitions. [2023-01-28 06:56:47,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 317 transitions, 2686 flow [2023-01-28 06:56:47,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 317 transitions, 2669 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-01-28 06:56:47,288 INFO L231 Difference]: Finished difference. Result has 81 places, 124 transitions, 1254 flow [2023-01-28 06:56:47,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1254, PETRI_PLACES=81, PETRI_TRANSITIONS=124} [2023-01-28 06:56:47,289 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2023-01-28 06:56:47,289 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 124 transitions, 1254 flow [2023-01-28 06:56:47,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.42857142857143) internal successors, (738), 7 states have internal predecessors, (738), 0 states have call successors, (0), 0 states 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 06:56:47,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:47,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:47,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:56:47,289 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:47,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:47,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2115425159, now seen corresponding path program 4 times [2023-01-28 06:56:47,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:47,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586390626] [2023-01-28 06:56:47,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:47,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:47,841 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 06:56:47,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:47,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586390626] [2023-01-28 06:56:47,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586390626] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:47,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:47,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:56:47,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095383331] [2023-01-28 06:56:47,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:47,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:56:47,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:47,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:56:47,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:56:47,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 242 [2023-01-28 06:56:47,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 124 transitions, 1254 flow. Second operand has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:47,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:47,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 242 [2023-01-28 06:56:47,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:49,208 INFO L130 PetriNetUnfolder]: 7578/12456 cut-off events. [2023-01-28 06:56:49,208 INFO L131 PetriNetUnfolder]: For 39050/39375 co-relation queries the response was YES. [2023-01-28 06:56:49,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53095 conditions, 12456 events. 7578/12456 cut-off events. For 39050/39375 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 88071 event pairs, 580 based on Foata normal form. 228/12549 useless extension candidates. Maximal degree in co-relation 53057. Up to 4672 conditions per place. [2023-01-28 06:56:49,279 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 183 selfloop transitions, 24 changer transitions 49/294 dead transitions. [2023-01-28 06:56:49,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 294 transitions, 2896 flow [2023-01-28 06:56:49,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:56:49,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:56:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 998 transitions. [2023-01-28 06:56:49,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515495867768595 [2023-01-28 06:56:49,293 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 998 transitions. [2023-01-28 06:56:49,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 998 transitions. [2023-01-28 06:56:49,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:49,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 998 transitions. [2023-01-28 06:56:49,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.75) internal successors, (998), 8 states have internal predecessors, (998), 0 states have call successors, (0), 0 states 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 06:56:49,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:49,302 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:49,302 INFO L175 Difference]: Start difference. First operand has 81 places, 124 transitions, 1254 flow. Second operand 8 states and 998 transitions. [2023-01-28 06:56:49,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 294 transitions, 2896 flow [2023-01-28 06:56:49,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 294 transitions, 2868 flow, removed 14 selfloop flow, removed 0 redundant places. [2023-01-28 06:56:49,704 INFO L231 Difference]: Finished difference. Result has 92 places, 131 transitions, 1366 flow [2023-01-28 06:56:49,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1236, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1366, PETRI_PLACES=92, PETRI_TRANSITIONS=131} [2023-01-28 06:56:49,705 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 49 predicate places. [2023-01-28 06:56:49,705 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 131 transitions, 1366 flow [2023-01-28 06:56:49,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:49,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:49,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:49,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:56:49,706 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:49,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:49,706 INFO L85 PathProgramCache]: Analyzing trace with hash -602507445, now seen corresponding path program 5 times [2023-01-28 06:56:49,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:49,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811382767] [2023-01-28 06:56:49,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:49,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:49,946 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 06:56:49,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:49,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811382767] [2023-01-28 06:56:49,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811382767] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:49,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:49,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:56:49,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545027023] [2023-01-28 06:56:49,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:49,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:56:49,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:49,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:56:49,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:56:49,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-01-28 06:56:49,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 131 transitions, 1366 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states 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 06:56:49,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:49,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-01-28 06:56:49,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:51,357 INFO L130 PetriNetUnfolder]: 6959/11289 cut-off events. [2023-01-28 06:56:51,357 INFO L131 PetriNetUnfolder]: For 53075/53283 co-relation queries the response was YES. [2023-01-28 06:56:51,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52901 conditions, 11289 events. 6959/11289 cut-off events. For 53075/53283 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 79380 event pairs, 849 based on Foata normal form. 270/11419 useless extension candidates. Maximal degree in co-relation 52857. Up to 4445 conditions per place. [2023-01-28 06:56:51,437 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 183 selfloop transitions, 18 changer transitions 70/303 dead transitions. [2023-01-28 06:56:51,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 303 transitions, 3550 flow [2023-01-28 06:56:51,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:56:51,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:56:51,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 960 transitions. [2023-01-28 06:56:51,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49586776859504134 [2023-01-28 06:56:51,440 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 960 transitions. [2023-01-28 06:56:51,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 960 transitions. [2023-01-28 06:56:51,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:51,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 960 transitions. [2023-01-28 06:56:51,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states 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 06:56:51,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:51,444 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:51,444 INFO L175 Difference]: Start difference. First operand has 92 places, 131 transitions, 1366 flow. Second operand 8 states and 960 transitions. [2023-01-28 06:56:51,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 303 transitions, 3550 flow [2023-01-28 06:56:52,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 303 transitions, 3372 flow, removed 33 selfloop flow, removed 6 redundant places. [2023-01-28 06:56:52,151 INFO L231 Difference]: Finished difference. Result has 94 places, 117 transitions, 1209 flow [2023-01-28 06:56:52,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1274, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1209, PETRI_PLACES=94, PETRI_TRANSITIONS=117} [2023-01-28 06:56:52,152 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places. [2023-01-28 06:56:52,152 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 117 transitions, 1209 flow [2023-01-28 06:56:52,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states 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 06:56:52,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:52,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:52,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 06:56:52,152 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:52,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:52,153 INFO L85 PathProgramCache]: Analyzing trace with hash 438623857, now seen corresponding path program 1 times [2023-01-28 06:56:52,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:52,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348584781] [2023-01-28 06:56:52,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:52,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:52,454 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 06:56:52,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:52,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348584781] [2023-01-28 06:56:52,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348584781] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:52,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:52,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:56:52,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795609726] [2023-01-28 06:56:52,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:52,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:56:52,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:52,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:56:52,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:56:52,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 242 [2023-01-28 06:56:52,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 117 transitions, 1209 flow. Second operand has 6 states, 6 states have (on average 107.66666666666667) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 states 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 06:56:52,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:52,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 242 [2023-01-28 06:56:52,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:53,510 INFO L130 PetriNetUnfolder]: 6625/10405 cut-off events. [2023-01-28 06:56:53,510 INFO L131 PetriNetUnfolder]: For 53270/53270 co-relation queries the response was YES. [2023-01-28 06:56:53,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53168 conditions, 10405 events. 6625/10405 cut-off events. For 53270/53270 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 65350 event pairs, 556 based on Foata normal form. 2/10407 useless extension candidates. Maximal degree in co-relation 53134. Up to 4767 conditions per place. [2023-01-28 06:56:53,555 INFO L137 encePairwiseOnDemand]: 228/242 looper letters, 136 selfloop transitions, 85 changer transitions 111/332 dead transitions. [2023-01-28 06:56:53,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 332 transitions, 3694 flow [2023-01-28 06:56:53,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-28 06:56:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-28 06:56:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1301 transitions. [2023-01-28 06:56:53,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48873027798647634 [2023-01-28 06:56:53,558 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1301 transitions. [2023-01-28 06:56:53,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1301 transitions. [2023-01-28 06:56:53,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:53,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1301 transitions. [2023-01-28 06:56:53,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 118.27272727272727) internal successors, (1301), 11 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states 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 06:56:53,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 242.0) internal successors, (2904), 12 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:53,563 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 242.0) internal successors, (2904), 12 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:53,563 INFO L175 Difference]: Start difference. First operand has 94 places, 117 transitions, 1209 flow. Second operand 11 states and 1301 transitions. [2023-01-28 06:56:53,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 332 transitions, 3694 flow [2023-01-28 06:56:53,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 332 transitions, 3433 flow, removed 62 selfloop flow, removed 8 redundant places. [2023-01-28 06:56:53,898 INFO L231 Difference]: Finished difference. Result has 101 places, 145 transitions, 1759 flow [2023-01-28 06:56:53,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1759, PETRI_PLACES=101, PETRI_TRANSITIONS=145} [2023-01-28 06:56:53,898 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 58 predicate places. [2023-01-28 06:56:53,899 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 145 transitions, 1759 flow [2023-01-28 06:56:53,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.66666666666667) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 states 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 06:56:53,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:53,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:53,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:56:53,899 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:53,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:53,899 INFO L85 PathProgramCache]: Analyzing trace with hash 351013515, now seen corresponding path program 2 times [2023-01-28 06:56:53,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:53,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671176389] [2023-01-28 06:56:53,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:53,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:54,054 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 06:56:54,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:54,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671176389] [2023-01-28 06:56:54,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671176389] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:54,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:54,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:56:54,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439439491] [2023-01-28 06:56:54,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:54,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:56:54,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:54,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:56:54,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:56:54,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-01-28 06:56:54,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 145 transitions, 1759 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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 06:56:54,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:54,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-01-28 06:56:54,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:54,947 INFO L130 PetriNetUnfolder]: 5516/8942 cut-off events. [2023-01-28 06:56:54,947 INFO L131 PetriNetUnfolder]: For 52253/52253 co-relation queries the response was YES. [2023-01-28 06:56:54,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46376 conditions, 8942 events. 5516/8942 cut-off events. For 52253/52253 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 57868 event pairs, 1538 based on Foata normal form. 1/8943 useless extension candidates. Maximal degree in co-relation 46329. Up to 4999 conditions per place. [2023-01-28 06:56:54,988 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 118 selfloop transitions, 23 changer transitions 74/215 dead transitions. [2023-01-28 06:56:54,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 215 transitions, 2801 flow [2023-01-28 06:56:54,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:56:54,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:56:54,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-01-28 06:56:54,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051652892561983 [2023-01-28 06:56:54,989 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-01-28 06:56:54,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-01-28 06:56:54,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:54,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-01-28 06:56:54,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states 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 06:56:54,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:54,992 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:54,992 INFO L175 Difference]: Start difference. First operand has 101 places, 145 transitions, 1759 flow. Second operand 4 states and 489 transitions. [2023-01-28 06:56:54,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 215 transitions, 2801 flow [2023-01-28 06:56:55,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 215 transitions, 2739 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-01-28 06:56:55,321 INFO L231 Difference]: Finished difference. Result has 100 places, 106 transitions, 1169 flow [2023-01-28 06:56:55,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1718, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1169, PETRI_PLACES=100, PETRI_TRANSITIONS=106} [2023-01-28 06:56:55,322 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2023-01-28 06:56:55,322 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 106 transitions, 1169 flow [2023-01-28 06:56:55,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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 06:56:55,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:55,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:55,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 06:56:55,322 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:55,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:55,323 INFO L85 PathProgramCache]: Analyzing trace with hash -651950697, now seen corresponding path program 3 times [2023-01-28 06:56:55,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:55,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586041068] [2023-01-28 06:56:55,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:55,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:55,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:55,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586041068] [2023-01-28 06:56:55,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586041068] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:55,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:55,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:56:55,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101811030] [2023-01-28 06:56:55,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:55,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:56:55,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:55,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:56:55,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:56:55,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 242 [2023-01-28 06:56:55,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 106 transitions, 1169 flow. Second operand has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 0 states have call successors, (0), 0 states 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 06:56:55,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:55,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 242 [2023-01-28 06:56:55,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:56,685 INFO L130 PetriNetUnfolder]: 2850/4624 cut-off events. [2023-01-28 06:56:56,686 INFO L131 PetriNetUnfolder]: For 24128/24128 co-relation queries the response was YES. [2023-01-28 06:56:56,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22944 conditions, 4624 events. 2850/4624 cut-off events. For 24128/24128 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 26387 event pairs, 254 based on Foata normal form. 1/4625 useless extension candidates. Maximal degree in co-relation 22896. Up to 1724 conditions per place. [2023-01-28 06:56:56,711 INFO L137 encePairwiseOnDemand]: 231/242 looper letters, 157 selfloop transitions, 40 changer transitions 43/240 dead transitions. [2023-01-28 06:56:56,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 240 transitions, 2582 flow [2023-01-28 06:56:56,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:56:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:56:56,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 976 transitions. [2023-01-28 06:56:56,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44811753902662993 [2023-01-28 06:56:56,713 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 976 transitions. [2023-01-28 06:56:56,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 976 transitions. [2023-01-28 06:56:56,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:56,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 976 transitions. [2023-01-28 06:56:56,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 108.44444444444444) internal successors, (976), 9 states have internal predecessors, (976), 0 states have call successors, (0), 0 states 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 06:56:56,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:56,717 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:56,717 INFO L175 Difference]: Start difference. First operand has 100 places, 106 transitions, 1169 flow. Second operand 9 states and 976 transitions. [2023-01-28 06:56:56,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 240 transitions, 2582 flow [2023-01-28 06:56:56,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 240 transitions, 2373 flow, removed 53 selfloop flow, removed 8 redundant places. [2023-01-28 06:56:56,812 INFO L231 Difference]: Finished difference. Result has 102 places, 114 transitions, 1223 flow [2023-01-28 06:56:56,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1223, PETRI_PLACES=102, PETRI_TRANSITIONS=114} [2023-01-28 06:56:56,812 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 59 predicate places. [2023-01-28 06:56:56,813 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 114 transitions, 1223 flow [2023-01-28 06:56:56,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 0 states have call successors, (0), 0 states 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 06:56:56,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:56,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:56,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 06:56:56,813 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:56,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:56,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1473680957, now seen corresponding path program 4 times [2023-01-28 06:56:56,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:56,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003494986] [2023-01-28 06:56:56,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:56,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:56,970 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 06:56:56,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:56,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003494986] [2023-01-28 06:56:56,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003494986] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:56,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:56,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:56:56,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176618174] [2023-01-28 06:56:56,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:56,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:56:56,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:56,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:56:56,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:56:56,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 242 [2023-01-28 06:56:56,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 114 transitions, 1223 flow. Second operand has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:56,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:56,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 242 [2023-01-28 06:56:56,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:57,494 INFO L130 PetriNetUnfolder]: 3134/5152 cut-off events. [2023-01-28 06:56:57,494 INFO L131 PetriNetUnfolder]: For 24284/24328 co-relation queries the response was YES. [2023-01-28 06:56:57,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25107 conditions, 5152 events. 3134/5152 cut-off events. For 24284/24328 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 30624 event pairs, 810 based on Foata normal form. 20/5147 useless extension candidates. Maximal degree in co-relation 25062. Up to 3102 conditions per place. [2023-01-28 06:56:57,513 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 66 selfloop transitions, 2 changer transitions 105/177 dead transitions. [2023-01-28 06:56:57,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 177 transitions, 2092 flow [2023-01-28 06:56:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:56:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:56:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 504 transitions. [2023-01-28 06:56:57,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5206611570247934 [2023-01-28 06:56:57,514 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 504 transitions. [2023-01-28 06:56:57,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 504 transitions. [2023-01-28 06:56:57,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:57,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 504 transitions. [2023-01-28 06:56:57,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states 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 06:56:57,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:57,517 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:57,517 INFO L175 Difference]: Start difference. First operand has 102 places, 114 transitions, 1223 flow. Second operand 4 states and 504 transitions. [2023-01-28 06:56:57,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 177 transitions, 2092 flow [2023-01-28 06:56:57,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 177 transitions, 2009 flow, removed 8 selfloop flow, removed 7 redundant places. [2023-01-28 06:56:57,613 INFO L231 Difference]: Finished difference. Result has 99 places, 65 transitions, 546 flow [2023-01-28 06:56:57,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=546, PETRI_PLACES=99, PETRI_TRANSITIONS=65} [2023-01-28 06:56:57,614 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 56 predicate places. [2023-01-28 06:56:57,614 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 65 transitions, 546 flow [2023-01-28 06:56:57,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:57,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:57,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:57,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 06:56:57,614 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:57,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:57,615 INFO L85 PathProgramCache]: Analyzing trace with hash -491243477, now seen corresponding path program 5 times [2023-01-28 06:56:57,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:57,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305652860] [2023-01-28 06:56:57,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:57,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:56:57,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:56:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:56:57,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:56:57,689 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:56:57,690 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-28 06:56:57,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-28 06:56:57,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-28 06:56:57,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-28 06:56:57,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-28 06:56:57,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-28 06:56:57,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-28 06:56:57,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 06:56:57,692 INFO L445 BasicCegarLoop]: Path program histogram: [5, 5, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:57,695 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:56:57,695 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:56:57,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:56:57 BasicIcfg [2023-01-28 06:56:57,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:56:57,743 INFO L158 Benchmark]: Toolchain (without parser) took 27239.04ms. Allocated memory was 507.5MB in the beginning and 2.5GB in the end (delta: 2.0GB). Free memory was 457.6MB in the beginning and 2.2GB in the end (delta: -1.8GB). Peak memory consumption was 247.7MB. Max. memory is 16.0GB. [2023-01-28 06:56:57,743 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 373.3MB. Free memory is still 322.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:56:57,743 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.67ms. Allocated memory is still 507.5MB. Free memory was 457.6MB in the beginning and 433.7MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-28 06:56:57,743 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.56ms. Allocated memory is still 507.5MB. Free memory was 433.3MB in the beginning and 430.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:56:57,743 INFO L158 Benchmark]: Boogie Preprocessor took 35.81ms. Allocated memory is still 507.5MB. Free memory was 430.8MB in the beginning and 429.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:56:57,743 INFO L158 Benchmark]: RCFGBuilder took 679.35ms. Allocated memory is still 507.5MB. Free memory was 428.7MB in the beginning and 461.5MB in the end (delta: -32.7MB). Peak memory consumption was 36.6MB. Max. memory is 16.0GB. [2023-01-28 06:56:57,743 INFO L158 Benchmark]: TraceAbstraction took 26034.98ms. Allocated memory was 507.5MB in the beginning and 2.5GB in the end (delta: 2.0GB). Free memory was 461.5MB in the beginning and 2.2GB in the end (delta: -1.8GB). Peak memory consumption was 248.9MB. Max. memory is 16.0GB. [2023-01-28 06:56:57,744 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 373.3MB. Free memory is still 322.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 432.67ms. Allocated memory is still 507.5MB. Free memory was 457.6MB in the beginning and 433.7MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.56ms. Allocated memory is still 507.5MB. Free memory was 433.3MB in the beginning and 430.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.81ms. Allocated memory is still 507.5MB. Free memory was 430.8MB in the beginning and 429.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 679.35ms. Allocated memory is still 507.5MB. Free memory was 428.7MB in the beginning and 461.5MB in the end (delta: -32.7MB). Peak memory consumption was 36.6MB. Max. memory is 16.0GB. * TraceAbstraction took 26034.98ms. Allocated memory was 507.5MB in the beginning and 2.5GB in the end (delta: 2.0GB). Free memory was 461.5MB in the beginning and 2.2GB in the end (delta: -1.8GB). Peak memory consumption was 248.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 140 PlacesBefore, 43 PlacesAfterwards, 129 TransitionsBefore, 31 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 8894 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3188, independent: 2946, independent conditional: 0, independent unconditional: 2946, dependent: 242, dependent conditional: 0, dependent unconditional: 242, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1743, independent: 1690, independent conditional: 0, independent unconditional: 1690, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3188, independent: 1256, independent conditional: 0, independent unconditional: 1256, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 1743, unknown conditional: 0, unknown unconditional: 1743] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 152, Positive conditional cache size: 0, Positive unconditional cache size: 152, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1129; [L872] FCALL, FORK 0 pthread_create(&t1129, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1129, ((void *)0), P0, ((void *)0))=-3, t1129={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1130; [L874] FCALL, FORK 0 pthread_create(&t1130, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1130, ((void *)0), P1, ((void *)0))=-2, t1129={5:0}, t1130={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1131; [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L876] FCALL, FORK 0 pthread_create(&t1131, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1131, ((void *)0), P2, ((void *)0))=-1, t1129={5:0}, t1130={6:0}, t1131={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L877] 0 pthread_t t1132; [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L878] FCALL, FORK 0 pthread_create(&t1132, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1132, ((void *)0), P3, ((void *)0))=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L807] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L824] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice2=0, x=1, y=1, z=2] [L891] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 878]: 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, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 888 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 888 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2653 IncrementalHoareTripleChecker+Invalid, 2756 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 39 mSDtfsCounter, 2653 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1759occurred in iteration=12, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 335 NumberOfCodeBlocks, 335 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 2551 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 06:56:57,758 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...