/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:42:43,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:42:43,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:42:44,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:42:44,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:42:44,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:42:44,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:42:44,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:42:44,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:42:44,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:42:44,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:42:44,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:42:44,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:42:44,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:42:44,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:42:44,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:42:44,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:42:44,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:42:44,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:42:44,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:42:44,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:42:44,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:42:44,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:42:44,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:42:44,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:42:44,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:42:44,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:42:44,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:42:44,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:42:44,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:42:44,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:42:44,057 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:42:44,058 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:42:44,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:42:44,059 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:42:44,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:42:44,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:42:44,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:42:44,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:42:44,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:42:44,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:42:44,061 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 00:42:44,083 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:42:44,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:42:44,084 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:42:44,084 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:42:44,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:42:44,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:42:44,085 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:42:44,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:42:44,085 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:42:44,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:42:44,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:42:44,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:42:44,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:42:44,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:42:44,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:42:44,086 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:42:44,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:42:44,086 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:42:44,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:42:44,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:42:44,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:42:44,086 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:42:44,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:42:44,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:42:44,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:42:44,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:42:44,087 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:42:44,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:42:44,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:42:44,087 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:42:44,087 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:42:44,087 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:42:44,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:42:44,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:42:44,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:42:44,270 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:42:44,270 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:42:44,271 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-01-28 00:42:45,258 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:42:45,469 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:42:45,470 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-01-28 00:42:45,485 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a341f0bf/565fd62c0d014a8dbed273ee39da3de5/FLAG010c41dc9 [2023-01-28 00:42:45,494 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a341f0bf/565fd62c0d014a8dbed273ee39da3de5 [2023-01-28 00:42:45,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:42:45,497 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:42:45,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:42:45,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:42:45,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:42:45,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:42:45" (1/1) ... [2023-01-28 00:42:45,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7365d0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:45, skipping insertion in model container [2023-01-28 00:42:45,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:42:45" (1/1) ... [2023-01-28 00:42:45,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:42:45,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:42:45,688 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/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-01-28 00:42:45,860 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:42:45,870 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:42:45,877 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/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-01-28 00:42:45,922 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:42:45,953 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:42:45,953 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:42:45,958 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:42:45,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:45 WrapperNode [2023-01-28 00:42:45,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:42:45,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:42:45,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:42:45,959 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:42:45,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:45" (1/1) ... [2023-01-28 00:42:45,989 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:45" (1/1) ... [2023-01-28 00:42:46,015 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 167 [2023-01-28 00:42:46,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:42:46,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:42:46,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:42:46,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:42:46,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:45" (1/1) ... [2023-01-28 00:42:46,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:45" (1/1) ... [2023-01-28 00:42:46,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:45" (1/1) ... [2023-01-28 00:42:46,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:45" (1/1) ... [2023-01-28 00:42:46,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:45" (1/1) ... [2023-01-28 00:42:46,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:45" (1/1) ... [2023-01-28 00:42:46,050 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:45" (1/1) ... [2023-01-28 00:42:46,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:45" (1/1) ... [2023-01-28 00:42:46,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:42:46,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:42:46,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:42:46,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:42:46,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:45" (1/1) ... [2023-01-28 00:42:46,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:42:46,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:42:46,093 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 00:42:46,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 00:42:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:42:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:42:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:42:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:42:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:42:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:42:46,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:42:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:42:46,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:42:46,143 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:42:46,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:42:46,143 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-28 00:42:46,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-28 00:42:46,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:42:46,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:42:46,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:42:46,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:42:46,145 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:42:46,235 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:42:46,236 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:42:46,479 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:42:46,601 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:42:46,602 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:42:46,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:42:46 BoogieIcfgContainer [2023-01-28 00:42:46,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:42:46,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:42:46,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:42:46,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:42:46,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:42:45" (1/3) ... [2023-01-28 00:42:46,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79742b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:42:46, skipping insertion in model container [2023-01-28 00:42:46,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:45" (2/3) ... [2023-01-28 00:42:46,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79742b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:42:46, skipping insertion in model container [2023-01-28 00:42:46,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:42:46" (3/3) ... [2023-01-28 00:42:46,609 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-01-28 00:42:46,620 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:42:46,620 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:42:46,620 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:42:46,679 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:42:46,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2023-01-28 00:42:46,752 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2023-01-28 00:42:46,752 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:42:46,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-01-28 00:42:46,758 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2023-01-28 00:42:46,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2023-01-28 00:42:46,763 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:42:46,769 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2023-01-28 00:42:46,770 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2023-01-28 00:42:46,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2023-01-28 00:42:46,791 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2023-01-28 00:42:46,791 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:42:46,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-01-28 00:42:46,793 INFO L119 LiptonReduction]: Number of co-enabled transitions 2936 [2023-01-28 00:42:49,541 INFO L134 LiptonReduction]: Checked pairs total: 6820 [2023-01-28 00:42:49,541 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-01-28 00:42:49,554 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:42:49,576 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;@769ac07, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:42:49,577 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-28 00:42:49,592 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2023-01-28 00:42:49,592 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:42:49,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:49,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:49,594 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:42:49,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:49,599 INFO L85 PathProgramCache]: Analyzing trace with hash -273626498, now seen corresponding path program 1 times [2023-01-28 00:42:49,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:49,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229490178] [2023-01-28 00:42:49,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:49,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:49,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:42:49,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:49,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229490178] [2023-01-28 00:42:49,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229490178] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:49,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:49,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:42:49,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405703446] [2023-01-28 00:42:49,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:49,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:42:49,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:49,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:42:49,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:42:49,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 235 [2023-01-28 00:42:49,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 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 00:42:49,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:49,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 235 [2023-01-28 00:42:49,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:50,349 INFO L130 PetriNetUnfolder]: 3113/4519 cut-off events. [2023-01-28 00:42:50,350 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-01-28 00:42:50,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8913 conditions, 4519 events. 3113/4519 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 24198 event pairs, 593 based on Foata normal form. 0/4326 useless extension candidates. Maximal degree in co-relation 8901. Up to 3385 conditions per place. [2023-01-28 00:42:50,370 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 32 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-01-28 00:42:50,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 164 flow [2023-01-28 00:42:50,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:42:50,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:42:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-01-28 00:42:50,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5446808510638298 [2023-01-28 00:42:50,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-01-28 00:42:50,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-01-28 00:42:50,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:50,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-01-28 00:42:50,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:50,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:50,387 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:50,388 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 384 transitions. [2023-01-28 00:42:50,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 164 flow [2023-01-28 00:42:50,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 00:42:50,392 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-01-28 00:42:50,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-01-28 00:42:50,395 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-01-28 00:42:50,395 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-01-28 00:42:50,396 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 00:42:50,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:50,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:50,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:42:50,396 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:42:50,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:50,396 INFO L85 PathProgramCache]: Analyzing trace with hash 243126665, now seen corresponding path program 1 times [2023-01-28 00:42:50,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:50,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035532469] [2023-01-28 00:42:50,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:50,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:42:50,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:50,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035532469] [2023-01-28 00:42:50,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035532469] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:50,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:50,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:42:50,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106720988] [2023-01-28 00:42:50,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:50,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:42:50,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:50,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:42:50,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:42:50,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-28 00:42:50,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:50,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:50,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-28 00:42:50,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:52,069 INFO L130 PetriNetUnfolder]: 11263/15464 cut-off events. [2023-01-28 00:42:52,070 INFO L131 PetriNetUnfolder]: For 272/272 co-relation queries the response was YES. [2023-01-28 00:42:52,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31454 conditions, 15464 events. 11263/15464 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 77721 event pairs, 2087 based on Foata normal form. 720/16184 useless extension candidates. Maximal degree in co-relation 31444. Up to 7121 conditions per place. [2023-01-28 00:42:52,124 INFO L137 encePairwiseOnDemand]: 223/235 looper letters, 45 selfloop transitions, 10 changer transitions 40/95 dead transitions. [2023-01-28 00:42:52,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 95 transitions, 394 flow [2023-01-28 00:42:52,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:42:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:42:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 770 transitions. [2023-01-28 00:42:52,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2023-01-28 00:42:52,127 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 770 transitions. [2023-01-28 00:42:52,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 770 transitions. [2023-01-28 00:42:52,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:52,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 770 transitions. [2023-01-28 00:42:52,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:52,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:52,132 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:52,132 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 7 states and 770 transitions. [2023-01-28 00:42:52,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 95 transitions, 394 flow [2023-01-28 00:42:52,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 95 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:42:52,137 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 158 flow [2023-01-28 00:42:52,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=158, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-01-28 00:42:52,138 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2023-01-28 00:42:52,138 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 158 flow [2023-01-28 00:42:52,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:52,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:52,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:52,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:42:52,139 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:42:52,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:52,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1656233583, now seen corresponding path program 1 times [2023-01-28 00:42:52,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:52,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302059948] [2023-01-28 00:42:52,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:52,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:52,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:42:52,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:52,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302059948] [2023-01-28 00:42:52,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302059948] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:52,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:52,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:42:52,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609941790] [2023-01-28 00:42:52,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:52,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:42:52,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:52,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:42:52,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:42:52,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-28 00:42:52,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:52,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:52,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-28 00:42:52,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:53,578 INFO L130 PetriNetUnfolder]: 11182/15497 cut-off events. [2023-01-28 00:42:53,578 INFO L131 PetriNetUnfolder]: For 15828/15828 co-relation queries the response was YES. [2023-01-28 00:42:53,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47216 conditions, 15497 events. 11182/15497 cut-off events. For 15828/15828 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 80805 event pairs, 1039 based on Foata normal form. 550/16047 useless extension candidates. Maximal degree in co-relation 47200. Up to 8595 conditions per place. [2023-01-28 00:42:53,652 INFO L137 encePairwiseOnDemand]: 222/235 looper letters, 56 selfloop transitions, 20 changer transitions 37/113 dead transitions. [2023-01-28 00:42:53,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 113 transitions, 700 flow [2023-01-28 00:42:53,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:42:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:42:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 781 transitions. [2023-01-28 00:42:53,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47477203647416416 [2023-01-28 00:42:53,654 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 781 transitions. [2023-01-28 00:42:53,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 781 transitions. [2023-01-28 00:42:53,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:53,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 781 transitions. [2023-01-28 00:42:53,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.57142857142857) internal successors, (781), 7 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:53,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:53,658 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:53,658 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 158 flow. Second operand 7 states and 781 transitions. [2023-01-28 00:42:53,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 113 transitions, 700 flow [2023-01-28 00:42:53,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 113 transitions, 692 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 00:42:53,748 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 317 flow [2023-01-28 00:42:53,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=317, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-01-28 00:42:53,749 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2023-01-28 00:42:53,752 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 317 flow [2023-01-28 00:42:53,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:53,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:53,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:53,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:42:53,752 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:42:53,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:53,753 INFO L85 PathProgramCache]: Analyzing trace with hash -196410352, now seen corresponding path program 1 times [2023-01-28 00:42:53,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:53,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118609636] [2023-01-28 00:42:53,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:53,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:42:54,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:54,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118609636] [2023-01-28 00:42:54,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118609636] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:54,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:54,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:42:54,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134300212] [2023-01-28 00:42:54,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:54,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:42:54,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:54,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:42:54,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:42:54,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-28 00:42:54,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:54,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:54,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-28 00:42:54,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:55,257 INFO L130 PetriNetUnfolder]: 10691/14832 cut-off events. [2023-01-28 00:42:55,257 INFO L131 PetriNetUnfolder]: For 41291/41291 co-relation queries the response was YES. [2023-01-28 00:42:55,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55978 conditions, 14832 events. 10691/14832 cut-off events. For 41291/41291 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 77487 event pairs, 1159 based on Foata normal form. 472/15304 useless extension candidates. Maximal degree in co-relation 55956. Up to 8401 conditions per place. [2023-01-28 00:42:55,335 INFO L137 encePairwiseOnDemand]: 222/235 looper letters, 64 selfloop transitions, 25 changer transitions 39/128 dead transitions. [2023-01-28 00:42:55,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 128 transitions, 1077 flow [2023-01-28 00:42:55,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:42:55,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:42:55,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 774 transitions. [2023-01-28 00:42:55,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.470516717325228 [2023-01-28 00:42:55,340 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 774 transitions. [2023-01-28 00:42:55,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 774 transitions. [2023-01-28 00:42:55,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:55,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 774 transitions. [2023-01-28 00:42:55,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:55,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:55,345 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:55,345 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 317 flow. Second operand 7 states and 774 transitions. [2023-01-28 00:42:55,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 128 transitions, 1077 flow [2023-01-28 00:42:55,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 128 transitions, 1061 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-01-28 00:42:55,544 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 622 flow [2023-01-28 00:42:55,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=622, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2023-01-28 00:42:55,545 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2023-01-28 00:42:55,546 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 64 transitions, 622 flow [2023-01-28 00:42:55,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:55,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:55,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:55,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:42:55,546 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:42:55,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:55,546 INFO L85 PathProgramCache]: Analyzing trace with hash -672716148, now seen corresponding path program 1 times [2023-01-28 00:42:55,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:55,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118539553] [2023-01-28 00:42:55,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:55,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:42:55,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:55,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118539553] [2023-01-28 00:42:55,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118539553] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:55,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:55,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:42:55,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554136688] [2023-01-28 00:42:55,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:55,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:42:55,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:55,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:42:55,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:42:55,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-28 00:42:55,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 64 transitions, 622 flow. Second operand has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:55,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:55,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-28 00:42:55,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:57,178 INFO L130 PetriNetUnfolder]: 13229/18482 cut-off events. [2023-01-28 00:42:57,179 INFO L131 PetriNetUnfolder]: For 75968/75968 co-relation queries the response was YES. [2023-01-28 00:42:57,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76413 conditions, 18482 events. 13229/18482 cut-off events. For 75968/75968 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 100177 event pairs, 2623 based on Foata normal form. 432/18914 useless extension candidates. Maximal degree in co-relation 76386. Up to 7683 conditions per place. [2023-01-28 00:42:57,277 INFO L137 encePairwiseOnDemand]: 222/235 looper letters, 66 selfloop transitions, 41 changer transitions 36/143 dead transitions. [2023-01-28 00:42:57,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 143 transitions, 1418 flow [2023-01-28 00:42:57,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:42:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:42:57,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 774 transitions. [2023-01-28 00:42:57,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.470516717325228 [2023-01-28 00:42:57,280 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 774 transitions. [2023-01-28 00:42:57,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 774 transitions. [2023-01-28 00:42:57,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:57,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 774 transitions. [2023-01-28 00:42:57,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:57,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:57,283 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:57,283 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 622 flow. Second operand 7 states and 774 transitions. [2023-01-28 00:42:57,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 143 transitions, 1418 flow [2023-01-28 00:42:57,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 143 transitions, 1402 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-01-28 00:42:57,450 INFO L231 Difference]: Finished difference. Result has 70 places, 77 transitions, 971 flow [2023-01-28 00:42:57,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=971, PETRI_PLACES=70, PETRI_TRANSITIONS=77} [2023-01-28 00:42:57,451 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2023-01-28 00:42:57,451 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 77 transitions, 971 flow [2023-01-28 00:42:57,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:57,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:57,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:57,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:42:57,451 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:42:57,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:57,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2006318020, now seen corresponding path program 1 times [2023-01-28 00:42:57,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:57,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138549819] [2023-01-28 00:42:57,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:57,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:42:57,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:57,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138549819] [2023-01-28 00:42:57,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138549819] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:57,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:57,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:42:57,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277189120] [2023-01-28 00:42:57,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:57,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:42:57,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:57,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:42:57,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:42:57,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-01-28 00:42:57,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 77 transitions, 971 flow. Second operand has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:57,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:57,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-01-28 00:42:57,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:59,002 INFO L130 PetriNetUnfolder]: 9622/14180 cut-off events. [2023-01-28 00:42:59,002 INFO L131 PetriNetUnfolder]: For 96937/98364 co-relation queries the response was YES. [2023-01-28 00:42:59,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65024 conditions, 14180 events. 9622/14180 cut-off events. For 96937/98364 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 85456 event pairs, 2375 based on Foata normal form. 1033/14994 useless extension candidates. Maximal degree in co-relation 64989. Up to 9641 conditions per place. [2023-01-28 00:42:59,084 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 92 selfloop transitions, 12 changer transitions 22/147 dead transitions. [2023-01-28 00:42:59,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 147 transitions, 1932 flow [2023-01-28 00:42:59,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:42:59,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:42:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 705 transitions. [2023-01-28 00:42:59,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-01-28 00:42:59,086 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 705 transitions. [2023-01-28 00:42:59,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 705 transitions. [2023-01-28 00:42:59,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:59,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 705 transitions. [2023-01-28 00:42:59,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:59,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:59,089 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:59,089 INFO L175 Difference]: Start difference. First operand has 70 places, 77 transitions, 971 flow. Second operand 6 states and 705 transitions. [2023-01-28 00:42:59,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 147 transitions, 1932 flow [2023-01-28 00:42:59,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 147 transitions, 1910 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-01-28 00:42:59,238 INFO L231 Difference]: Finished difference. Result has 72 places, 85 transitions, 1098 flow [2023-01-28 00:42:59,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=953, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1098, PETRI_PLACES=72, PETRI_TRANSITIONS=85} [2023-01-28 00:42:59,240 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2023-01-28 00:42:59,240 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 85 transitions, 1098 flow [2023-01-28 00:42:59,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:59,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:59,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:59,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:42:59,241 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:42:59,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:59,241 INFO L85 PathProgramCache]: Analyzing trace with hash 271270556, now seen corresponding path program 1 times [2023-01-28 00:42:59,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:59,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353004993] [2023-01-28 00:42:59,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:59,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:42:59,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:59,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353004993] [2023-01-28 00:42:59,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353004993] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:59,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:59,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:42:59,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667967339] [2023-01-28 00:42:59,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:59,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:42:59,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:59,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:42:59,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:42:59,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-01-28 00:42:59,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 85 transitions, 1098 flow. Second operand has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:59,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:59,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-01-28 00:42:59,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:01,254 INFO L130 PetriNetUnfolder]: 10332/15054 cut-off events. [2023-01-28 00:43:01,254 INFO L131 PetriNetUnfolder]: For 111662/113297 co-relation queries the response was YES. [2023-01-28 00:43:01,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74190 conditions, 15054 events. 10332/15054 cut-off events. For 111662/113297 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 90031 event pairs, 1773 based on Foata normal form. 944/15731 useless extension candidates. Maximal degree in co-relation 74153. Up to 10500 conditions per place. [2023-01-28 00:43:01,346 INFO L137 encePairwiseOnDemand]: 227/235 looper letters, 93 selfloop transitions, 30 changer transitions 13/157 dead transitions. [2023-01-28 00:43:01,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 157 transitions, 2149 flow [2023-01-28 00:43:01,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:43:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:43:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 699 transitions. [2023-01-28 00:43:01,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4957446808510638 [2023-01-28 00:43:01,348 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 699 transitions. [2023-01-28 00:43:01,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 699 transitions. [2023-01-28 00:43:01,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:01,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 699 transitions. [2023-01-28 00:43:01,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:01,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:01,352 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:01,352 INFO L175 Difference]: Start difference. First operand has 72 places, 85 transitions, 1098 flow. Second operand 6 states and 699 transitions. [2023-01-28 00:43:01,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 157 transitions, 2149 flow [2023-01-28 00:43:01,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 157 transitions, 2068 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 00:43:01,482 INFO L231 Difference]: Finished difference. Result has 76 places, 105 transitions, 1449 flow [2023-01-28 00:43:01,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1449, PETRI_PLACES=76, PETRI_TRANSITIONS=105} [2023-01-28 00:43:01,482 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2023-01-28 00:43:01,482 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 105 transitions, 1449 flow [2023-01-28 00:43:01,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:01,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:01,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:01,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:43:01,483 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:01,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:01,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1653571782, now seen corresponding path program 2 times [2023-01-28 00:43:01,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:01,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306574188] [2023-01-28 00:43:01,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:01,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:01,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:01,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306574188] [2023-01-28 00:43:01,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306574188] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:01,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:01,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:43:01,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876043514] [2023-01-28 00:43:01,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:01,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:43:01,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:01,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:43:01,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:43:01,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-28 00:43:01,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 105 transitions, 1449 flow. Second operand has 8 states, 8 states have (on average 98.125) internal successors, (785), 8 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:01,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:01,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-28 00:43:01,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:03,701 INFO L130 PetriNetUnfolder]: 14125/19886 cut-off events. [2023-01-28 00:43:03,701 INFO L131 PetriNetUnfolder]: For 144352/144352 co-relation queries the response was YES. [2023-01-28 00:43:03,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102998 conditions, 19886 events. 14125/19886 cut-off events. For 144352/144352 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 109918 event pairs, 1035 based on Foata normal form. 552/20438 useless extension candidates. Maximal degree in co-relation 102958. Up to 6877 conditions per place. [2023-01-28 00:43:03,827 INFO L137 encePairwiseOnDemand]: 221/235 looper letters, 134 selfloop transitions, 50 changer transitions 61/245 dead transitions. [2023-01-28 00:43:03,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 245 transitions, 3559 flow [2023-01-28 00:43:03,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 00:43:03,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 00:43:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 981 transitions. [2023-01-28 00:43:03,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46382978723404256 [2023-01-28 00:43:03,829 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 981 transitions. [2023-01-28 00:43:03,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 981 transitions. [2023-01-28 00:43:03,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:03,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 981 transitions. [2023-01-28 00:43:03,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 109.0) internal successors, (981), 9 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:03,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:03,834 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:03,834 INFO L175 Difference]: Start difference. First operand has 76 places, 105 transitions, 1449 flow. Second operand 9 states and 981 transitions. [2023-01-28 00:43:03,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 245 transitions, 3559 flow [2023-01-28 00:43:04,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 245 transitions, 3516 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-01-28 00:43:04,092 INFO L231 Difference]: Finished difference. Result has 87 places, 123 transitions, 1974 flow [2023-01-28 00:43:04,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1974, PETRI_PLACES=87, PETRI_TRANSITIONS=123} [2023-01-28 00:43:04,093 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2023-01-28 00:43:04,093 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 123 transitions, 1974 flow [2023-01-28 00:43:04,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.125) internal successors, (785), 8 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:04,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:04,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:04,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:43:04,094 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:04,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:04,094 INFO L85 PathProgramCache]: Analyzing trace with hash -175886107, now seen corresponding path program 1 times [2023-01-28 00:43:04,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:04,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048964758] [2023-01-28 00:43:04,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:04,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:04,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:04,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:04,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048964758] [2023-01-28 00:43:04,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048964758] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:04,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:04,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:43:04,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397146703] [2023-01-28 00:43:04,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:04,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:43:04,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:04,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:43:04,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:43:04,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 235 [2023-01-28 00:43:04,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 123 transitions, 1974 flow. Second operand has 7 states, 7 states have (on average 96.57142857142857) internal successors, (676), 7 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:04,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:04,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 235 [2023-01-28 00:43:04,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:07,766 INFO L130 PetriNetUnfolder]: 15901/22538 cut-off events. [2023-01-28 00:43:07,766 INFO L131 PetriNetUnfolder]: For 222749/222749 co-relation queries the response was YES. [2023-01-28 00:43:07,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125468 conditions, 22538 events. 15901/22538 cut-off events. For 222749/222749 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 130488 event pairs, 1435 based on Foata normal form. 304/22842 useless extension candidates. Maximal degree in co-relation 125422. Up to 10239 conditions per place. [2023-01-28 00:43:07,899 INFO L137 encePairwiseOnDemand]: 221/235 looper letters, 119 selfloop transitions, 138 changer transitions 49/306 dead transitions. [2023-01-28 00:43:07,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 306 transitions, 4703 flow [2023-01-28 00:43:07,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-28 00:43:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-28 00:43:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1383 transitions. [2023-01-28 00:43:07,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45270049099836335 [2023-01-28 00:43:07,903 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1383 transitions. [2023-01-28 00:43:07,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1383 transitions. [2023-01-28 00:43:07,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:07,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1383 transitions. [2023-01-28 00:43:07,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 106.38461538461539) internal successors, (1383), 13 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:07,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 235.0) internal successors, (3290), 14 states have internal predecessors, (3290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:07,909 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 235.0) internal successors, (3290), 14 states have internal predecessors, (3290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:07,909 INFO L175 Difference]: Start difference. First operand has 87 places, 123 transitions, 1974 flow. Second operand 13 states and 1383 transitions. [2023-01-28 00:43:07,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 306 transitions, 4703 flow [2023-01-28 00:43:09,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 306 transitions, 4591 flow, removed 48 selfloop flow, removed 3 redundant places. [2023-01-28 00:43:09,122 INFO L231 Difference]: Finished difference. Result has 101 places, 190 transitions, 3636 flow [2023-01-28 00:43:09,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1922, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3636, PETRI_PLACES=101, PETRI_TRANSITIONS=190} [2023-01-28 00:43:09,123 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2023-01-28 00:43:09,123 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 190 transitions, 3636 flow [2023-01-28 00:43:09,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.57142857142857) internal successors, (676), 7 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:09,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:09,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:09,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:43:09,124 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:09,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:09,124 INFO L85 PathProgramCache]: Analyzing trace with hash 963103137, now seen corresponding path program 2 times [2023-01-28 00:43:09,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:09,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302037521] [2023-01-28 00:43:09,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:09,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:09,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:09,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:09,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302037521] [2023-01-28 00:43:09,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302037521] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:09,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:09,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:43:09,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643522670] [2023-01-28 00:43:09,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:09,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:43:09,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:09,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:43:09,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:43:09,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-28 00:43:09,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 190 transitions, 3636 flow. Second operand has 8 states, 8 states have (on average 98.25) internal successors, (786), 8 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:09,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:09,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-28 00:43:09,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:12,655 INFO L130 PetriNetUnfolder]: 15957/22674 cut-off events. [2023-01-28 00:43:12,655 INFO L131 PetriNetUnfolder]: For 303707/303707 co-relation queries the response was YES. [2023-01-28 00:43:12,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141143 conditions, 22674 events. 15957/22674 cut-off events. For 303707/303707 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 132515 event pairs, 4099 based on Foata normal form. 272/22946 useless extension candidates. Maximal degree in co-relation 141090. Up to 15599 conditions per place. [2023-01-28 00:43:12,783 INFO L137 encePairwiseOnDemand]: 224/235 looper letters, 213 selfloop transitions, 49 changer transitions 40/302 dead transitions. [2023-01-28 00:43:12,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 302 transitions, 5884 flow [2023-01-28 00:43:12,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 00:43:12,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 00:43:12,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 859 transitions. [2023-01-28 00:43:12,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45691489361702126 [2023-01-28 00:43:12,791 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 859 transitions. [2023-01-28 00:43:12,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 859 transitions. [2023-01-28 00:43:12,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:12,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 859 transitions. [2023-01-28 00:43:12,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.375) internal successors, (859), 8 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 00:43:12,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:12,795 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:12,795 INFO L175 Difference]: Start difference. First operand has 101 places, 190 transitions, 3636 flow. Second operand 8 states and 859 transitions. [2023-01-28 00:43:12,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 302 transitions, 5884 flow [2023-01-28 00:43:14,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 302 transitions, 5584 flow, removed 138 selfloop flow, removed 8 redundant places. [2023-01-28 00:43:14,967 INFO L231 Difference]: Finished difference. Result has 101 places, 211 transitions, 3996 flow [2023-01-28 00:43:14,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=3424, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3996, PETRI_PLACES=101, PETRI_TRANSITIONS=211} [2023-01-28 00:43:14,971 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2023-01-28 00:43:14,972 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 211 transitions, 3996 flow [2023-01-28 00:43:14,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.25) internal successors, (786), 8 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:14,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:14,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:14,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:43:14,972 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:14,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:14,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1600301353, now seen corresponding path program 3 times [2023-01-28 00:43:14,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:14,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695194522] [2023-01-28 00:43:14,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:14,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:15,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:15,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695194522] [2023-01-28 00:43:15,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695194522] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:15,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:15,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:43:15,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193160093] [2023-01-28 00:43:15,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:15,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:43:15,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:15,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:43:15,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:43:15,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 235 [2023-01-28 00:43:15,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 211 transitions, 3996 flow. Second operand has 8 states, 8 states have (on average 96.25) internal successors, (770), 8 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:15,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:15,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 235 [2023-01-28 00:43:15,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:18,275 INFO L130 PetriNetUnfolder]: 16346/23371 cut-off events. [2023-01-28 00:43:18,276 INFO L131 PetriNetUnfolder]: For 290317/290317 co-relation queries the response was YES. [2023-01-28 00:43:18,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147515 conditions, 23371 events. 16346/23371 cut-off events. For 290317/290317 co-relation queries the response was YES. Maximal size of possible extension queue 961. Compared 138511 event pairs, 1818 based on Foata normal form. 272/23643 useless extension candidates. Maximal degree in co-relation 147462. Up to 11149 conditions per place. [2023-01-28 00:43:18,567 INFO L137 encePairwiseOnDemand]: 221/235 looper letters, 168 selfloop transitions, 143 changer transitions 43/354 dead transitions. [2023-01-28 00:43:18,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 354 transitions, 6594 flow [2023-01-28 00:43:18,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 00:43:18,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 00:43:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1064 transitions. [2023-01-28 00:43:18,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45276595744680853 [2023-01-28 00:43:18,569 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1064 transitions. [2023-01-28 00:43:18,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1064 transitions. [2023-01-28 00:43:18,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:18,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1064 transitions. [2023-01-28 00:43:18,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.4) internal successors, (1064), 10 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:18,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 235.0) internal successors, (2585), 11 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:18,574 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 235.0) internal successors, (2585), 11 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:18,574 INFO L175 Difference]: Start difference. First operand has 101 places, 211 transitions, 3996 flow. Second operand 10 states and 1064 transitions. [2023-01-28 00:43:18,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 354 transitions, 6594 flow [2023-01-28 00:43:20,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 354 transitions, 6452 flow, removed 37 selfloop flow, removed 5 redundant places. [2023-01-28 00:43:20,217 INFO L231 Difference]: Finished difference. Result has 112 places, 263 transitions, 5526 flow [2023-01-28 00:43:20,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=3895, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5526, PETRI_PLACES=112, PETRI_TRANSITIONS=263} [2023-01-28 00:43:20,218 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 70 predicate places. [2023-01-28 00:43:20,218 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 263 transitions, 5526 flow [2023-01-28 00:43:20,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.25) internal successors, (770), 8 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:20,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:20,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:20,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:43:20,219 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:20,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:20,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2031542937, now seen corresponding path program 4 times [2023-01-28 00:43:20,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:20,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408214697] [2023-01-28 00:43:20,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:20,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:20,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:20,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408214697] [2023-01-28 00:43:20,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408214697] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:20,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:20,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:43:20,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834763964] [2023-01-28 00:43:20,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:20,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:43:20,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:20,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:43:20,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:43:20,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 235 [2023-01-28 00:43:20,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 263 transitions, 5526 flow. Second operand has 7 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:20,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:20,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 235 [2023-01-28 00:43:20,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:23,520 INFO L130 PetriNetUnfolder]: 14187/21191 cut-off events. [2023-01-28 00:43:23,521 INFO L131 PetriNetUnfolder]: For 344433/346863 co-relation queries the response was YES. [2023-01-28 00:43:23,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142876 conditions, 21191 events. 14187/21191 cut-off events. For 344433/346863 co-relation queries the response was YES. Maximal size of possible extension queue 1082. Compared 140847 event pairs, 1991 based on Foata normal form. 1652/22122 useless extension candidates. Maximal degree in co-relation 142815. Up to 11029 conditions per place. [2023-01-28 00:43:23,695 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 199 selfloop transitions, 23 changer transitions 24/319 dead transitions. [2023-01-28 00:43:23,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 319 transitions, 6855 flow [2023-01-28 00:43:23,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:43:23,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:43:23,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 791 transitions. [2023-01-28 00:43:23,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4808510638297872 [2023-01-28 00:43:23,697 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 791 transitions. [2023-01-28 00:43:23,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 791 transitions. [2023-01-28 00:43:23,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:23,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 791 transitions. [2023-01-28 00:43:23,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:23,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:23,700 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:23,700 INFO L175 Difference]: Start difference. First operand has 112 places, 263 transitions, 5526 flow. Second operand 7 states and 791 transitions. [2023-01-28 00:43:23,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 319 transitions, 6855 flow [2023-01-28 00:43:25,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 319 transitions, 6749 flow, removed 48 selfloop flow, removed 3 redundant places. [2023-01-28 00:43:25,634 INFO L231 Difference]: Finished difference. Result has 115 places, 263 transitions, 5511 flow [2023-01-28 00:43:25,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=5442, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5511, PETRI_PLACES=115, PETRI_TRANSITIONS=263} [2023-01-28 00:43:25,635 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 73 predicate places. [2023-01-28 00:43:25,635 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 263 transitions, 5511 flow [2023-01-28 00:43:25,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:25,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:25,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:25,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 00:43:25,635 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:25,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:25,636 INFO L85 PathProgramCache]: Analyzing trace with hash 886799159, now seen corresponding path program 1 times [2023-01-28 00:43:25,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:25,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185752610] [2023-01-28 00:43:25,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:25,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:25,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:25,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185752610] [2023-01-28 00:43:25,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185752610] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:25,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:25,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:43:25,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315512380] [2023-01-28 00:43:25,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:25,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:43:25,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:25,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:43:25,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:43:25,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 235 [2023-01-28 00:43:25,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 263 transitions, 5511 flow. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:25,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:25,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 235 [2023-01-28 00:43:25,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:28,021 INFO L130 PetriNetUnfolder]: 10864/16522 cut-off events. [2023-01-28 00:43:28,021 INFO L131 PetriNetUnfolder]: For 452829/462901 co-relation queries the response was YES. [2023-01-28 00:43:28,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111515 conditions, 16522 events. 10864/16522 cut-off events. For 452829/462901 co-relation queries the response was YES. Maximal size of possible extension queue 1142. Compared 115632 event pairs, 1956 based on Foata normal form. 5530/21534 useless extension candidates. Maximal degree in co-relation 111452. Up to 11110 conditions per place. [2023-01-28 00:43:28,163 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 375 selfloop transitions, 10 changer transitions 74/529 dead transitions. [2023-01-28 00:43:28,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 529 transitions, 12169 flow [2023-01-28 00:43:28,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:43:28,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:43:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2023-01-28 00:43:28,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5148936170212766 [2023-01-28 00:43:28,165 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 605 transitions. [2023-01-28 00:43:28,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 605 transitions. [2023-01-28 00:43:28,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:28,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 605 transitions. [2023-01-28 00:43:28,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:28,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:28,168 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:28,168 INFO L175 Difference]: Start difference. First operand has 115 places, 263 transitions, 5511 flow. Second operand 5 states and 605 transitions. [2023-01-28 00:43:28,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 529 transitions, 12169 flow [2023-01-28 00:43:28,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 529 transitions, 12107 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-01-28 00:43:28,802 INFO L231 Difference]: Finished difference. Result has 114 places, 254 transitions, 5285 flow [2023-01-28 00:43:28,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=5110, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5285, PETRI_PLACES=114, PETRI_TRANSITIONS=254} [2023-01-28 00:43:28,802 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places. [2023-01-28 00:43:28,803 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 254 transitions, 5285 flow [2023-01-28 00:43:28,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:28,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:28,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:28,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 00:43:28,803 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:28,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:28,803 INFO L85 PathProgramCache]: Analyzing trace with hash -597741335, now seen corresponding path program 1 times [2023-01-28 00:43:28,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:28,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664060571] [2023-01-28 00:43:28,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:28,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:28,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:28,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664060571] [2023-01-28 00:43:28,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664060571] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:28,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:28,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:43:28,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572355042] [2023-01-28 00:43:28,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:28,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:43:28,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:28,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:43:28,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:43:28,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 235 [2023-01-28 00:43:28,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 254 transitions, 5285 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:28,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:28,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 235 [2023-01-28 00:43:28,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:30,718 INFO L130 PetriNetUnfolder]: 8408/13257 cut-off events. [2023-01-28 00:43:30,718 INFO L131 PetriNetUnfolder]: For 392495/402003 co-relation queries the response was YES. [2023-01-28 00:43:30,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98457 conditions, 13257 events. 8408/13257 cut-off events. For 392495/402003 co-relation queries the response was YES. Maximal size of possible extension queue 957. Compared 95782 event pairs, 503 based on Foata normal form. 4870/17740 useless extension candidates. Maximal degree in co-relation 98395. Up to 5449 conditions per place. [2023-01-28 00:43:30,833 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 422 selfloop transitions, 18 changer transitions 137/635 dead transitions. [2023-01-28 00:43:30,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 635 transitions, 14742 flow [2023-01-28 00:43:30,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:43:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:43:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 848 transitions. [2023-01-28 00:43:30,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155015197568389 [2023-01-28 00:43:30,836 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 848 transitions. [2023-01-28 00:43:30,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 848 transitions. [2023-01-28 00:43:30,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:30,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 848 transitions. [2023-01-28 00:43:30,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:30,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:30,839 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:30,839 INFO L175 Difference]: Start difference. First operand has 114 places, 254 transitions, 5285 flow. Second operand 7 states and 848 transitions. [2023-01-28 00:43:30,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 635 transitions, 14742 flow [2023-01-28 00:43:31,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 635 transitions, 14334 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-01-28 00:43:31,336 INFO L231 Difference]: Finished difference. Result has 120 places, 221 transitions, 4449 flow [2023-01-28 00:43:31,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=4236, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4449, PETRI_PLACES=120, PETRI_TRANSITIONS=221} [2023-01-28 00:43:31,337 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 78 predicate places. [2023-01-28 00:43:31,337 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 221 transitions, 4449 flow [2023-01-28 00:43:31,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:31,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:31,337 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] [2023-01-28 00:43:31,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 00:43:31,337 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:31,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:31,338 INFO L85 PathProgramCache]: Analyzing trace with hash -989767449, now seen corresponding path program 1 times [2023-01-28 00:43:31,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:31,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248062635] [2023-01-28 00:43:31,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:31,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:31,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:31,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248062635] [2023-01-28 00:43:31,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248062635] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:31,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:31,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:43:31,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662433995] [2023-01-28 00:43:31,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:31,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:43:31,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:31,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:43:31,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:43:31,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-28 00:43:31,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 221 transitions, 4449 flow. Second operand has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:31,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:31,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-28 00:43:31,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:34,461 INFO L130 PetriNetUnfolder]: 14311/22452 cut-off events. [2023-01-28 00:43:34,462 INFO L131 PetriNetUnfolder]: For 394141/394141 co-relation queries the response was YES. [2023-01-28 00:43:34,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175294 conditions, 22452 events. 14311/22452 cut-off events. For 394141/394141 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 159215 event pairs, 2880 based on Foata normal form. 110/22562 useless extension candidates. Maximal degree in co-relation 175230. Up to 11813 conditions per place. [2023-01-28 00:43:34,611 INFO L137 encePairwiseOnDemand]: 222/235 looper letters, 181 selfloop transitions, 60 changer transitions 130/371 dead transitions. [2023-01-28 00:43:34,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 371 transitions, 7350 flow [2023-01-28 00:43:34,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:43:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:43:34,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 767 transitions. [2023-01-28 00:43:34,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4662613981762918 [2023-01-28 00:43:34,635 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 767 transitions. [2023-01-28 00:43:34,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 767 transitions. [2023-01-28 00:43:34,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:34,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 767 transitions. [2023-01-28 00:43:34,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:34,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:34,648 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:34,648 INFO L175 Difference]: Start difference. First operand has 120 places, 221 transitions, 4449 flow. Second operand 7 states and 767 transitions. [2023-01-28 00:43:34,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 371 transitions, 7350 flow [2023-01-28 00:43:37,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 371 transitions, 7203 flow, removed 53 selfloop flow, removed 4 redundant places. [2023-01-28 00:43:37,142 INFO L231 Difference]: Finished difference. Result has 126 places, 176 transitions, 3669 flow [2023-01-28 00:43:37,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=4396, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3669, PETRI_PLACES=126, PETRI_TRANSITIONS=176} [2023-01-28 00:43:37,143 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 84 predicate places. [2023-01-28 00:43:37,143 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 176 transitions, 3669 flow [2023-01-28 00:43:37,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:37,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:37,144 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] [2023-01-28 00:43:37,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 00:43:37,144 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:37,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:37,145 INFO L85 PathProgramCache]: Analyzing trace with hash -706237089, now seen corresponding path program 1 times [2023-01-28 00:43:37,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:37,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190102904] [2023-01-28 00:43:37,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:37,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:37,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:37,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190102904] [2023-01-28 00:43:37,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190102904] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:37,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:37,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:43:37,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041944587] [2023-01-28 00:43:37,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:37,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:43:37,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:37,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:43:37,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:43:37,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 235 [2023-01-28 00:43:37,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 176 transitions, 3669 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 00:43:37,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:37,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 235 [2023-01-28 00:43:37,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:37,979 INFO L130 PetriNetUnfolder]: 2754/4742 cut-off events. [2023-01-28 00:43:37,980 INFO L131 PetriNetUnfolder]: For 125368/127204 co-relation queries the response was YES. [2023-01-28 00:43:38,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34084 conditions, 4742 events. 2754/4742 cut-off events. For 125368/127204 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 31514 event pairs, 197 based on Foata normal form. 1115/5722 useless extension candidates. Maximal degree in co-relation 34017. Up to 1759 conditions per place. [2023-01-28 00:43:38,013 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 248 selfloop transitions, 17 changer transitions 102/401 dead transitions. [2023-01-28 00:43:38,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 401 transitions, 9010 flow [2023-01-28 00:43:38,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:43:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:43:38,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 849 transitions. [2023-01-28 00:43:38,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161094224924012 [2023-01-28 00:43:38,015 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 849 transitions. [2023-01-28 00:43:38,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 849 transitions. [2023-01-28 00:43:38,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:38,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 849 transitions. [2023-01-28 00:43:38,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:38,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:38,020 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:38,020 INFO L175 Difference]: Start difference. First operand has 126 places, 176 transitions, 3669 flow. Second operand 7 states and 849 transitions. [2023-01-28 00:43:38,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 401 transitions, 9010 flow [2023-01-28 00:43:38,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 401 transitions, 8214 flow, removed 73 selfloop flow, removed 14 redundant places. [2023-01-28 00:43:38,157 INFO L231 Difference]: Finished difference. Result has 114 places, 148 transitions, 2661 flow [2023-01-28 00:43:38,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=2707, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2661, PETRI_PLACES=114, PETRI_TRANSITIONS=148} [2023-01-28 00:43:38,158 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places. [2023-01-28 00:43:38,158 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 148 transitions, 2661 flow [2023-01-28 00:43:38,158 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 00:43:38,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:38,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:38,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 00:43:38,159 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:38,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:38,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2136738546, now seen corresponding path program 1 times [2023-01-28 00:43:38,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:38,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949961393] [2023-01-28 00:43:38,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:38,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:38,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:38,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949961393] [2023-01-28 00:43:38,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949961393] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:38,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:38,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:43:38,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975402600] [2023-01-28 00:43:38,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:38,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:43:38,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:38,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:43:38,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:43:38,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 235 [2023-01-28 00:43:38,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 148 transitions, 2661 flow. Second operand has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:38,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:38,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 235 [2023-01-28 00:43:38,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:39,423 INFO L130 PetriNetUnfolder]: 4500/7871 cut-off events. [2023-01-28 00:43:39,424 INFO L131 PetriNetUnfolder]: For 115537/115537 co-relation queries the response was YES. [2023-01-28 00:43:39,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56871 conditions, 7871 events. 4500/7871 cut-off events. For 115537/115537 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 54850 event pairs, 570 based on Foata normal form. 16/7887 useless extension candidates. Maximal degree in co-relation 56828. Up to 2884 conditions per place. [2023-01-28 00:43:39,464 INFO L137 encePairwiseOnDemand]: 221/235 looper letters, 109 selfloop transitions, 47 changer transitions 192/348 dead transitions. [2023-01-28 00:43:39,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 348 transitions, 6293 flow [2023-01-28 00:43:39,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:43:39,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:43:39,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 767 transitions. [2023-01-28 00:43:39,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4662613981762918 [2023-01-28 00:43:39,465 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 767 transitions. [2023-01-28 00:43:39,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 767 transitions. [2023-01-28 00:43:39,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:39,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 767 transitions. [2023-01-28 00:43:39,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:39,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:39,467 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:39,467 INFO L175 Difference]: Start difference. First operand has 114 places, 148 transitions, 2661 flow. Second operand 7 states and 767 transitions. [2023-01-28 00:43:39,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 348 transitions, 6293 flow [2023-01-28 00:43:40,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 348 transitions, 5950 flow, removed 133 selfloop flow, removed 6 redundant places. [2023-01-28 00:43:40,039 INFO L231 Difference]: Finished difference. Result has 117 places, 107 transitions, 1923 flow [2023-01-28 00:43:40,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=2571, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1923, PETRI_PLACES=117, PETRI_TRANSITIONS=107} [2023-01-28 00:43:40,040 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places. [2023-01-28 00:43:40,040 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 107 transitions, 1923 flow [2023-01-28 00:43:40,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:40,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:40,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:40,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-28 00:43:40,041 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:40,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:40,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1212472198, now seen corresponding path program 2 times [2023-01-28 00:43:40,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:40,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526264633] [2023-01-28 00:43:40,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:40,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:40,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:40,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:40,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526264633] [2023-01-28 00:43:40,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526264633] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:40,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:40,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:43:40,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473269569] [2023-01-28 00:43:40,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:40,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:43:40,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:40,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:43:40,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:43:40,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 235 [2023-01-28 00:43:40,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 107 transitions, 1923 flow. Second operand has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:40,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:40,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 235 [2023-01-28 00:43:40,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:40,460 INFO L130 PetriNetUnfolder]: 1239/2224 cut-off events. [2023-01-28 00:43:40,460 INFO L131 PetriNetUnfolder]: For 34709/34996 co-relation queries the response was YES. [2023-01-28 00:43:40,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14868 conditions, 2224 events. 1239/2224 cut-off events. For 34709/34996 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 13419 event pairs, 120 based on Foata normal form. 219/2389 useless extension candidates. Maximal degree in co-relation 14825. Up to 791 conditions per place. [2023-01-28 00:43:40,470 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 33 selfloop transitions, 17 changer transitions 164/218 dead transitions. [2023-01-28 00:43:40,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 218 transitions, 4472 flow [2023-01-28 00:43:40,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 00:43:40,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 00:43:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 936 transitions. [2023-01-28 00:43:40,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4978723404255319 [2023-01-28 00:43:40,471 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 936 transitions. [2023-01-28 00:43:40,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 936 transitions. [2023-01-28 00:43:40,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:40,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 936 transitions. [2023-01-28 00:43:40,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:40,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:40,474 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:40,474 INFO L175 Difference]: Start difference. First operand has 117 places, 107 transitions, 1923 flow. Second operand 8 states and 936 transitions. [2023-01-28 00:43:40,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 218 transitions, 4472 flow [2023-01-28 00:43:40,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 218 transitions, 4228 flow, removed 29 selfloop flow, removed 6 redundant places. [2023-01-28 00:43:40,521 INFO L231 Difference]: Finished difference. Result has 116 places, 41 transitions, 454 flow [2023-01-28 00:43:40,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1791, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=454, PETRI_PLACES=116, PETRI_TRANSITIONS=41} [2023-01-28 00:43:40,521 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 74 predicate places. [2023-01-28 00:43:40,521 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 41 transitions, 454 flow [2023-01-28 00:43:40,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:40,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:40,521 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] [2023-01-28 00:43:40,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-01-28 00:43:40,522 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:40,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2145444237, now seen corresponding path program 1 times [2023-01-28 00:43:40,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:40,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881385900] [2023-01-28 00:43:40,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:40,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:43:40,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:43:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:43:40,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:43:40,579 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:43:40,580 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-28 00:43:40,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-28 00:43:40,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-28 00:43:40,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-28 00:43:40,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-28 00:43:40,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-28 00:43:40,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-28 00:43:40,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-01-28 00:43:40,582 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:40,586 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:43:40,586 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:43:40,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:43:40 BasicIcfg [2023-01-28 00:43:40,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:43:40,638 INFO L158 Benchmark]: Toolchain (without parser) took 55140.87ms. Allocated memory was 362.8MB in the beginning and 8.6GB in the end (delta: 8.2GB). Free memory was 306.8MB in the beginning and 6.1GB in the end (delta: -5.8GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. [2023-01-28 00:43:40,638 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 362.8MB. Free memory is still 308.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:43:40,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.69ms. Allocated memory is still 362.8MB. Free memory was 306.8MB in the beginning and 283.7MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 00:43:40,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.21ms. Allocated memory is still 362.8MB. Free memory was 283.7MB in the beginning and 280.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 00:43:40,638 INFO L158 Benchmark]: Boogie Preprocessor took 37.46ms. Allocated memory is still 362.8MB. Free memory was 280.7MB in the beginning and 278.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:43:40,639 INFO L158 Benchmark]: RCFGBuilder took 549.77ms. Allocated memory is still 362.8MB. Free memory was 278.6MB in the beginning and 243.8MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-01-28 00:43:40,639 INFO L158 Benchmark]: TraceAbstraction took 54032.76ms. Allocated memory was 362.8MB in the beginning and 8.6GB in the end (delta: 8.2GB). Free memory was 242.9MB in the beginning and 6.1GB in the end (delta: -5.9GB). Peak memory consumption was 2.3GB. Max. memory is 16.0GB. [2023-01-28 00:43:40,640 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.10ms. Allocated memory is still 362.8MB. Free memory is still 308.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 460.69ms. Allocated memory is still 362.8MB. Free memory was 306.8MB in the beginning and 283.7MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.21ms. Allocated memory is still 362.8MB. Free memory was 283.7MB in the beginning and 280.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.46ms. Allocated memory is still 362.8MB. Free memory was 280.7MB in the beginning and 278.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 549.77ms. Allocated memory is still 362.8MB. Free memory was 278.6MB in the beginning and 243.8MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 54032.76ms. Allocated memory was 362.8MB in the beginning and 8.6GB in the end (delta: 8.2GB). Free memory was 242.9MB in the beginning and 6.1GB in the end (delta: -5.9GB). Peak memory consumption was 2.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 136 PlacesBefore, 42 PlacesAfterwards, 125 TransitionsBefore, 30 TransitionsAfterwards, 2936 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 6820 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3180, independent: 3000, independent conditional: 0, independent unconditional: 3000, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1541, independent: 1507, independent conditional: 0, independent unconditional: 1507, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3180, independent: 1493, independent conditional: 0, independent unconditional: 1493, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 1541, unknown conditional: 0, unknown unconditional: 1541] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 111, Positive conditional cache size: 0, Positive unconditional cache size: 111, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1253; [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1253, ((void *)0), P0, ((void *)0))=-1, t1253={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 0 pthread_t t1254; [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1254, ((void *)0), P1, ((void *)0))=0, t1253={5:0}, t1254={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1255; [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1255, ((void *)0), P2, ((void *)0))=1, t1253={5:0}, t1254={6:0}, t1255={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1256; [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1256, ((void *)0), P3, ((void *)0))=2, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L804] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L804] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=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=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L813] 4 a = 1 [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=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=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 3 z = 1 VAL [__unbuffered_cnt=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=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=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=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=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=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 [L879] 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_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=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 851]: 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: 849]: 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: 845]: 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: 847]: 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, 165 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: 53.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 43.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 882 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 882 mSDsluCounter, 392 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 264 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3115 IncrementalHoareTripleChecker+Invalid, 3246 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 128 mSDtfsCounter, 3115 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5526occurred in iteration=11, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 342 NumberOfCodeBlocks, 342 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 297 ConstructedInterpolants, 0 QuantifiedInterpolants, 3488 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 00:43:40,655 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...