/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:55:43,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:55:43,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:55:43,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:55:43,220 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:55:43,222 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:55:43,224 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:55:43,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:55:43,227 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:55:43,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:55:43,231 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:55:43,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:55:43,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:55:43,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:55:43,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:55:43,234 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:55:43,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:55:43,235 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:55:43,236 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:55:43,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:55:43,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:55:43,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:55:43,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:55:43,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:55:43,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:55:43,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:55:43,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:55:43,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:55:43,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:55:43,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:55:43,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:55:43,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:55:43,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:55:43,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:55:43,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:55:43,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:55:43,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:55:43,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:55:43,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:55:43,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:55:43,266 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:55:43,267 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 06:55:43,299 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:55:43,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:55:43,300 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:55:43,300 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:55:43,301 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:55:43,301 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:55:43,301 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:55:43,301 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:55:43,302 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:55:43,302 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:55:43,302 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:55:43,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:55:43,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:55:43,303 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:55:43,303 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:55:43,303 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:55:43,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:55:43,303 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:55:43,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:55:43,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:55:43,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:55:43,304 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:55:43,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:55:43,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:55:43,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:55:43,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:55:43,304 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:55:43,304 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:55:43,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:55:43,305 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:55:43,305 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:55:43,305 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 06:55:43,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:55:43,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:55:43,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:55:43,478 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:55:43,478 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:55:43,479 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2023-01-28 06:55:44,453 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:55:44,684 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:55:44,685 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2023-01-28 06:55:44,698 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34c9ac661/1aa1f68912ca4de6b4f11af9b78b31bd/FLAG49ae9ab31 [2023-01-28 06:55:44,711 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34c9ac661/1aa1f68912ca4de6b4f11af9b78b31bd [2023-01-28 06:55:44,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:55:44,713 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:55:44,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:55:44,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:55:44,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:55:44,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:55:44" (1/1) ... [2023-01-28 06:55:44,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@561bfc36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:44, skipping insertion in model container [2023-01-28 06:55:44,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:55:44" (1/1) ... [2023-01-28 06:55:44,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:55:44,764 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:55:44,899 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/mix037_tso.oepc.i[949,962] [2023-01-28 06:55:45,073 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:55:45,084 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:55:45,092 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/mix037_tso.oepc.i[949,962] [2023-01-28 06:55:45,144 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:55:45,168 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:55:45,168 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:55:45,173 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:55:45,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:45 WrapperNode [2023-01-28 06:55:45,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:55:45,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:55:45,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:55:45,175 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:55:45,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:45" (1/1) ... [2023-01-28 06:55:45,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:45" (1/1) ... [2023-01-28 06:55:45,228 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2023-01-28 06:55:45,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:55:45,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:55:45,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:55:45,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:55:45,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:45" (1/1) ... [2023-01-28 06:55:45,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:45" (1/1) ... [2023-01-28 06:55:45,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:45" (1/1) ... [2023-01-28 06:55:45,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:45" (1/1) ... [2023-01-28 06:55:45,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:45" (1/1) ... [2023-01-28 06:55:45,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:45" (1/1) ... [2023-01-28 06:55:45,247 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:45" (1/1) ... [2023-01-28 06:55:45,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:45" (1/1) ... [2023-01-28 06:55:45,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:55:45,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:55:45,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:55:45,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:55:45,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:45" (1/1) ... [2023-01-28 06:55:45,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:55:45,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:55:45,273 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 06:55:45,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 06:55:45,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:55:45,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:55:45,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:55:45,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:55:45,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:55:45,346 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:55:45,346 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:55:45,346 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:55:45,346 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:55:45,346 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 06:55:45,346 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 06:55:45,346 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-28 06:55:45,346 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-28 06:55:45,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:55:45,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:55:45,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:55:45,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:55:45,347 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 06:55:45,517 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:55:45,518 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:55:45,742 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:55:45,903 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:55:45,904 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:55:45,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:55:45 BoogieIcfgContainer [2023-01-28 06:55:45,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:55:45,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:55:45,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:55:45,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:55:45,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:55:44" (1/3) ... [2023-01-28 06:55:45,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c29c2d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:55:45, skipping insertion in model container [2023-01-28 06:55:45,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:45" (2/3) ... [2023-01-28 06:55:45,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c29c2d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:55:45, skipping insertion in model container [2023-01-28 06:55:45,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:55:45" (3/3) ... [2023-01-28 06:55:45,911 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_tso.oepc.i [2023-01-28 06:55:45,923 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:55:45,923 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:55:45,923 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:55:45,973 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:55:46,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2023-01-28 06:55:46,064 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2023-01-28 06:55:46,065 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:55:46,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-28 06:55:46,069 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2023-01-28 06:55:46,082 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2023-01-28 06:55:46,085 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:55:46,095 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2023-01-28 06:55:46,097 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2023-01-28 06:55:46,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2023-01-28 06:55:46,133 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2023-01-28 06:55:46,134 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:55:46,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-28 06:55:46,137 INFO L119 LiptonReduction]: Number of co-enabled transitions 3256 [2023-01-28 06:55:49,773 INFO L134 LiptonReduction]: Checked pairs total: 9118 [2023-01-28 06:55:49,774 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-01-28 06:55:49,789 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:55:49,795 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;@f5fd2b6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:55:49,796 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-28 06:55:49,800 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-01-28 06:55:49,800 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:55:49,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:49,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-28 06:55:49,802 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:55:49,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:49,806 INFO L85 PathProgramCache]: Analyzing trace with hash 534773525, now seen corresponding path program 1 times [2023-01-28 06:55:49,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:49,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112034458] [2023-01-28 06:55:49,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:49,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:55:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:55:50,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:55:50,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112034458] [2023-01-28 06:55:50,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112034458] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:55:50,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:55:50,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:55:50,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857038769] [2023-01-28 06:55:50,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:55:50,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:55:50,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:55:50,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:55:50,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:55:50,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 244 [2023-01-28 06:55:50,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:50,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:55:50,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 244 [2023-01-28 06:55:50,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:55:50,936 INFO L130 PetriNetUnfolder]: 4903/6849 cut-off events. [2023-01-28 06:55:50,936 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2023-01-28 06:55:50,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13697 conditions, 6849 events. 4903/6849 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 34568 event pairs, 1733 based on Foata normal form. 0/6504 useless extension candidates. Maximal degree in co-relation 13685. Up to 5323 conditions per place. [2023-01-28 06:55:50,973 INFO L137 encePairwiseOnDemand]: 241/244 looper letters, 39 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2023-01-28 06:55:50,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 198 flow [2023-01-28 06:55:50,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:55:50,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:55:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2023-01-28 06:55:50,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396174863387978 [2023-01-28 06:55:50,988 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 395 transitions. [2023-01-28 06:55:50,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 395 transitions. [2023-01-28 06:55:50,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:55:50,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 395 transitions. [2023-01-28 06:55:50,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:50,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:51,000 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:51,001 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 395 transitions. [2023-01-28 06:55:51,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 198 flow [2023-01-28 06:55:51,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 06:55:51,007 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-01-28 06:55:51,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-01-28 06:55:51,011 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-01-28 06:55:51,011 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-01-28 06:55:51,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:51,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:51,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:51,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:55:51,012 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:55:51,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:51,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1622796010, now seen corresponding path program 1 times [2023-01-28 06:55:51,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:51,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681026709] [2023-01-28 06:55:51,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:51,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:55:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:55:51,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:55:51,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681026709] [2023-01-28 06:55:51,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681026709] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:55:51,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:55:51,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:55:51,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072363978] [2023-01-28 06:55:51,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:55:51,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:55:51,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:55:51,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:55:51,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:55:51,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 244 [2023-01-28 06:55:51,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:51,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:55:51,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 244 [2023-01-28 06:55:51,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:55:52,469 INFO L130 PetriNetUnfolder]: 8789/11850 cut-off events. [2023-01-28 06:55:52,469 INFO L131 PetriNetUnfolder]: For 607/607 co-relation queries the response was YES. [2023-01-28 06:55:52,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24626 conditions, 11850 events. 8789/11850 cut-off events. For 607/607 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 53288 event pairs, 2989 based on Foata normal form. 250/12100 useless extension candidates. Maximal degree in co-relation 24616. Up to 8176 conditions per place. [2023-01-28 06:55:52,521 INFO L137 encePairwiseOnDemand]: 241/244 looper letters, 40 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-01-28 06:55:52,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 182 flow [2023-01-28 06:55:52,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:55:52,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:55:52,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-01-28 06:55:52,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.476775956284153 [2023-01-28 06:55:52,523 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-01-28 06:55:52,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-01-28 06:55:52,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:55:52,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-01-28 06:55:52,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:52,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:52,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:52,526 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 349 transitions. [2023-01-28 06:55:52,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 182 flow [2023-01-28 06:55:52,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:55:52,528 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 72 flow [2023-01-28 06:55:52,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, 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=72, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-01-28 06:55:52,529 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-01-28 06:55:52,529 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 72 flow [2023-01-28 06:55:52,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:52,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:52,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:52,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:55:52,529 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:55:52,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:52,530 INFO L85 PathProgramCache]: Analyzing trace with hash 361637534, now seen corresponding path program 1 times [2023-01-28 06:55:52,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:52,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269451898] [2023-01-28 06:55:52,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:52,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:55:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:55:52,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:55:52,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269451898] [2023-01-28 06:55:52,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269451898] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:55:52,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:55:52,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:55:52,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566014416] [2023-01-28 06:55:52,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:55:52,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:55:52,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:55:52,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:55:52,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:55:52,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 244 [2023-01-28 06:55:52,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:52,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:55:52,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 244 [2023-01-28 06:55:52,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:55:53,521 INFO L130 PetriNetUnfolder]: 4455/6234 cut-off events. [2023-01-28 06:55:53,521 INFO L131 PetriNetUnfolder]: For 472/472 co-relation queries the response was YES. [2023-01-28 06:55:53,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13269 conditions, 6234 events. 4455/6234 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30068 event pairs, 1921 based on Foata normal form. 4/6226 useless extension candidates. Maximal degree in co-relation 13258. Up to 5989 conditions per place. [2023-01-28 06:55:53,544 INFO L137 encePairwiseOnDemand]: 238/244 looper letters, 36 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2023-01-28 06:55:53,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 195 flow [2023-01-28 06:55:53,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:55:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:55:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2023-01-28 06:55:53,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5204918032786885 [2023-01-28 06:55:53,546 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2023-01-28 06:55:53,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2023-01-28 06:55:53,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:55:53,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2023-01-28 06:55:53,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:53,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:53,548 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:53,548 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 72 flow. Second operand 3 states and 381 transitions. [2023-01-28 06:55:53,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 195 flow [2023-01-28 06:55:53,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:55:53,550 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 101 flow [2023-01-28 06:55:53,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2023-01-28 06:55:53,550 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-01-28 06:55:53,551 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 101 flow [2023-01-28 06:55:53,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:53,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:53,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:53,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:55:53,551 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:55:53,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:53,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1675870343, now seen corresponding path program 1 times [2023-01-28 06:55:53,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:53,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527394377] [2023-01-28 06:55:53,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:53,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:55:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:55:53,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:55:53,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527394377] [2023-01-28 06:55:53,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527394377] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:55:53,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:55:53,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:55:53,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159231481] [2023-01-28 06:55:53,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:55:54,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:55:54,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:55:54,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:55:54,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:55:54,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 244 [2023-01-28 06:55:54,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:54,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:55:54,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 244 [2023-01-28 06:55:54,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:55:54,541 INFO L130 PetriNetUnfolder]: 4647/6590 cut-off events. [2023-01-28 06:55:54,542 INFO L131 PetriNetUnfolder]: For 1315/1386 co-relation queries the response was YES. [2023-01-28 06:55:54,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15434 conditions, 6590 events. 4647/6590 cut-off events. For 1315/1386 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 33090 event pairs, 1911 based on Foata normal form. 74/6652 useless extension candidates. Maximal degree in co-relation 15422. Up to 5537 conditions per place. [2023-01-28 06:55:54,562 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 54 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2023-01-28 06:55:54,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 66 transitions, 321 flow [2023-01-28 06:55:54,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:55:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:55:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2023-01-28 06:55:54,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174180327868853 [2023-01-28 06:55:54,567 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 505 transitions. [2023-01-28 06:55:54,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 505 transitions. [2023-01-28 06:55:54,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:55:54,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 505 transitions. [2023-01-28 06:55:54,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:54,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:54,571 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:54,571 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 101 flow. Second operand 4 states and 505 transitions. [2023-01-28 06:55:54,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 66 transitions, 321 flow [2023-01-28 06:55:54,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:55:54,573 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 161 flow [2023-01-28 06:55:54,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-01-28 06:55:54,574 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-01-28 06:55:54,574 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 161 flow [2023-01-28 06:55:54,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:54,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:54,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:54,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:55:54,575 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:55:54,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:54,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1633272596, now seen corresponding path program 1 times [2023-01-28 06:55:54,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:54,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003041754] [2023-01-28 06:55:54,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:54,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:55:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:55:54,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:55:54,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003041754] [2023-01-28 06:55:54,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003041754] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:55:54,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:55:54,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:55:54,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280931416] [2023-01-28 06:55:54,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:55:54,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:55:54,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:55:54,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:55:54,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:55:54,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 244 [2023-01-28 06:55:54,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:54,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:55:54,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 244 [2023-01-28 06:55:54,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:55:55,955 INFO L130 PetriNetUnfolder]: 9532/12849 cut-off events. [2023-01-28 06:55:55,955 INFO L131 PetriNetUnfolder]: For 8457/8457 co-relation queries the response was YES. [2023-01-28 06:55:55,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34717 conditions, 12849 events. 9532/12849 cut-off events. For 8457/8457 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 59136 event pairs, 3771 based on Foata normal form. 20/12869 useless extension candidates. Maximal degree in co-relation 34702. Up to 10813 conditions per place. [2023-01-28 06:55:56,008 INFO L137 encePairwiseOnDemand]: 233/244 looper letters, 64 selfloop transitions, 15 changer transitions 0/79 dead transitions. [2023-01-28 06:55:56,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 452 flow [2023-01-28 06:55:56,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:55:56,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:55:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2023-01-28 06:55:56,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48975409836065575 [2023-01-28 06:55:56,011 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2023-01-28 06:55:56,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2023-01-28 06:55:56,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:55:56,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2023-01-28 06:55:56,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:56,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:56,014 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:56,014 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 161 flow. Second operand 4 states and 478 transitions. [2023-01-28 06:55:56,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 452 flow [2023-01-28 06:55:56,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 79 transitions, 446 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-01-28 06:55:56,024 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 271 flow [2023-01-28 06:55:56,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2023-01-28 06:55:56,026 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2023-01-28 06:55:56,026 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 271 flow [2023-01-28 06:55:56,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:56,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:56,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:56,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:55:56,027 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:55:56,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:56,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1623647044, now seen corresponding path program 2 times [2023-01-28 06:55:56,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:56,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029413985] [2023-01-28 06:55:56,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:56,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:55:56,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:55:56,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:55:56,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029413985] [2023-01-28 06:55:56,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029413985] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:55:56,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:55:56,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:55:56,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128340377] [2023-01-28 06:55:56,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:55:56,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:55:56,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:55:56,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:55:56,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:55:56,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 244 [2023-01-28 06:55:56,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 271 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:56,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:55:56,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 244 [2023-01-28 06:55:56,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:55:57,346 INFO L130 PetriNetUnfolder]: 6267/8894 cut-off events. [2023-01-28 06:55:57,346 INFO L131 PetriNetUnfolder]: For 11726/11812 co-relation queries the response was YES. [2023-01-28 06:55:57,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28461 conditions, 8894 events. 6267/8894 cut-off events. For 11726/11812 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 46156 event pairs, 2298 based on Foata normal form. 60/8798 useless extension candidates. Maximal degree in co-relation 28442. Up to 6566 conditions per place. [2023-01-28 06:55:57,413 INFO L137 encePairwiseOnDemand]: 240/244 looper letters, 67 selfloop transitions, 9 changer transitions 0/81 dead transitions. [2023-01-28 06:55:57,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 81 transitions, 544 flow [2023-01-28 06:55:57,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:55:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:55:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 511 transitions. [2023-01-28 06:55:57,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5235655737704918 [2023-01-28 06:55:57,415 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 511 transitions. [2023-01-28 06:55:57,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 511 transitions. [2023-01-28 06:55:57,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:55:57,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 511 transitions. [2023-01-28 06:55:57,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:57,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:57,418 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:57,418 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 271 flow. Second operand 4 states and 511 transitions. [2023-01-28 06:55:57,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 81 transitions, 544 flow [2023-01-28 06:55:57,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 81 transitions, 534 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-01-28 06:55:57,431 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 286 flow [2023-01-28 06:55:57,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=286, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2023-01-28 06:55:57,432 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2023-01-28 06:55:57,432 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 286 flow [2023-01-28 06:55:57,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:57,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:57,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:57,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:55:57,433 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:55:57,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:57,433 INFO L85 PathProgramCache]: Analyzing trace with hash -976250165, now seen corresponding path program 1 times [2023-01-28 06:55:57,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:57,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574104254] [2023-01-28 06:55:57,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:57,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:55:58,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:55:58,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:55:58,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574104254] [2023-01-28 06:55:58,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574104254] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:55:58,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:55:58,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:55:58,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977284741] [2023-01-28 06:55:58,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:55:58,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:55:58,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:55:58,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:55:58,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:55:58,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 244 [2023-01-28 06:55:58,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 286 flow. Second operand has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:58,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:55:58,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 244 [2023-01-28 06:55:58,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:55:58,995 INFO L130 PetriNetUnfolder]: 6586/9397 cut-off events. [2023-01-28 06:55:58,995 INFO L131 PetriNetUnfolder]: For 15915/16017 co-relation queries the response was YES. [2023-01-28 06:55:59,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30616 conditions, 9397 events. 6586/9397 cut-off events. For 15915/16017 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 49934 event pairs, 2319 based on Foata normal form. 20/9284 useless extension candidates. Maximal degree in co-relation 30595. Up to 6599 conditions per place. [2023-01-28 06:55:59,068 INFO L137 encePairwiseOnDemand]: 235/244 looper letters, 71 selfloop transitions, 22 changer transitions 0/98 dead transitions. [2023-01-28 06:55:59,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 98 transitions, 663 flow [2023-01-28 06:55:59,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:55:59,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:55:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 635 transitions. [2023-01-28 06:55:59,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5204918032786885 [2023-01-28 06:55:59,070 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 635 transitions. [2023-01-28 06:55:59,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 635 transitions. [2023-01-28 06:55:59,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:55:59,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 635 transitions. [2023-01-28 06:55:59,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:59,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:59,074 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:59,074 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 286 flow. Second operand 5 states and 635 transitions. [2023-01-28 06:55:59,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 98 transitions, 663 flow [2023-01-28 06:55:59,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 98 transitions, 643 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-01-28 06:55:59,090 INFO L231 Difference]: Finished difference. Result has 57 places, 58 transitions, 414 flow [2023-01-28 06:55:59,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=414, PETRI_PLACES=57, PETRI_TRANSITIONS=58} [2023-01-28 06:55:59,091 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2023-01-28 06:55:59,091 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 58 transitions, 414 flow [2023-01-28 06:55:59,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:59,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:59,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:59,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:55:59,092 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:55:59,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:59,092 INFO L85 PathProgramCache]: Analyzing trace with hash -973686155, now seen corresponding path program 2 times [2023-01-28 06:55:59,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:59,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445568964] [2023-01-28 06:55:59,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:59,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:55:59,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 06:55:59,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:55:59,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445568964] [2023-01-28 06:55:59,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445568964] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:55:59,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:55:59,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:55:59,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955403232] [2023-01-28 06:55:59,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:55:59,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:55:59,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:55:59,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:55:59,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:55:59,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 244 [2023-01-28 06:55:59,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 58 transitions, 414 flow. Second operand has 7 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:59,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:55:59,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 244 [2023-01-28 06:55:59,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:01,149 INFO L130 PetriNetUnfolder]: 10159/13688 cut-off events. [2023-01-28 06:56:01,150 INFO L131 PetriNetUnfolder]: For 31120/31120 co-relation queries the response was YES. [2023-01-28 06:56:01,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49341 conditions, 13688 events. 10159/13688 cut-off events. For 31120/31120 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 65840 event pairs, 1302 based on Foata normal form. 40/13728 useless extension candidates. Maximal degree in co-relation 49318. Up to 10081 conditions per place. [2023-01-28 06:56:01,205 INFO L137 encePairwiseOnDemand]: 235/244 looper letters, 116 selfloop transitions, 47 changer transitions 0/163 dead transitions. [2023-01-28 06:56:01,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 163 transitions, 1259 flow [2023-01-28 06:56:01,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:56:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:56:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 961 transitions. [2023-01-28 06:56:01,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4923155737704918 [2023-01-28 06:56:01,208 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 961 transitions. [2023-01-28 06:56:01,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 961 transitions. [2023-01-28 06:56:01,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:01,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 961 transitions. [2023-01-28 06:56:01,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.125) internal successors, (961), 8 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:01,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 244.0) internal successors, (2196), 9 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:01,212 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 244.0) internal successors, (2196), 9 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:01,212 INFO L175 Difference]: Start difference. First operand has 57 places, 58 transitions, 414 flow. Second operand 8 states and 961 transitions. [2023-01-28 06:56:01,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 163 transitions, 1259 flow [2023-01-28 06:56:01,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 163 transitions, 1206 flow, removed 21 selfloop flow, removed 1 redundant places. [2023-01-28 06:56:01,261 INFO L231 Difference]: Finished difference. Result has 65 places, 86 transitions, 780 flow [2023-01-28 06:56:01,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=780, PETRI_PLACES=65, PETRI_TRANSITIONS=86} [2023-01-28 06:56:01,262 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2023-01-28 06:56:01,262 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 86 transitions, 780 flow [2023-01-28 06:56:01,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:01,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:01,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:01,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:56:01,264 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:01,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:01,264 INFO L85 PathProgramCache]: Analyzing trace with hash -784427592, now seen corresponding path program 1 times [2023-01-28 06:56:01,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:01,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201402544] [2023-01-28 06:56:01,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:01,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:01,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:01,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:01,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201402544] [2023-01-28 06:56:01,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201402544] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:01,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:01,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:56:01,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093854083] [2023-01-28 06:56:01,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:01,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:56:01,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:01,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:56:01,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:56:01,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 244 [2023-01-28 06:56:01,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 86 transitions, 780 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:01,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:01,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 244 [2023-01-28 06:56:01,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:02,336 INFO L130 PetriNetUnfolder]: 5769/8348 cut-off events. [2023-01-28 06:56:02,341 INFO L131 PetriNetUnfolder]: For 40910/41698 co-relation queries the response was YES. [2023-01-28 06:56:02,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34523 conditions, 8348 events. 5769/8348 cut-off events. For 40910/41698 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 46708 event pairs, 1164 based on Foata normal form. 981/9109 useless extension candidates. Maximal degree in co-relation 34497. Up to 4741 conditions per place. [2023-01-28 06:56:02,401 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 174 selfloop transitions, 10 changer transitions 14/208 dead transitions. [2023-01-28 06:56:02,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 208 transitions, 2217 flow [2023-01-28 06:56:02,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:56:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:56:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2023-01-28 06:56:02,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5016393442622951 [2023-01-28 06:56:02,405 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2023-01-28 06:56:02,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2023-01-28 06:56:02,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:02,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2023-01-28 06:56:02,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:02,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:02,408 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:02,408 INFO L175 Difference]: Start difference. First operand has 65 places, 86 transitions, 780 flow. Second operand 5 states and 612 transitions. [2023-01-28 06:56:02,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 208 transitions, 2217 flow [2023-01-28 06:56:02,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 208 transitions, 1955 flow, removed 54 selfloop flow, removed 4 redundant places. [2023-01-28 06:56:02,448 INFO L231 Difference]: Finished difference. Result has 68 places, 88 transitions, 677 flow [2023-01-28 06:56:02,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=677, PETRI_PLACES=68, PETRI_TRANSITIONS=88} [2023-01-28 06:56:02,449 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2023-01-28 06:56:02,449 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 88 transitions, 677 flow [2023-01-28 06:56:02,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:02,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:02,450 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 06:56:02,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:56:02,450 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:02,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:02,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1147622950, now seen corresponding path program 1 times [2023-01-28 06:56:02,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:02,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305795883] [2023-01-28 06:56:02,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:02,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:02,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:02,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305795883] [2023-01-28 06:56:02,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305795883] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:02,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:02,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:56:02,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644164191] [2023-01-28 06:56:02,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:02,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:56:02,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:02,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:56:02,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:56:02,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 244 [2023-01-28 06:56:02,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 88 transitions, 677 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:02,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:02,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 244 [2023-01-28 06:56:02,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:03,462 INFO L130 PetriNetUnfolder]: 4606/6829 cut-off events. [2023-01-28 06:56:03,463 INFO L131 PetriNetUnfolder]: For 32294/32989 co-relation queries the response was YES. [2023-01-28 06:56:03,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30830 conditions, 6829 events. 4606/6829 cut-off events. For 32294/32989 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 39184 event pairs, 443 based on Foata normal form. 657/7309 useless extension candidates. Maximal degree in co-relation 30802. Up to 2324 conditions per place. [2023-01-28 06:56:03,525 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 206 selfloop transitions, 19 changer transitions 17/252 dead transitions. [2023-01-28 06:56:03,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 252 transitions, 2425 flow [2023-01-28 06:56:03,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:56:03,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:56:03,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 859 transitions. [2023-01-28 06:56:03,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502927400468384 [2023-01-28 06:56:03,528 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 859 transitions. [2023-01-28 06:56:03,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 859 transitions. [2023-01-28 06:56:03,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:03,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 859 transitions. [2023-01-28 06:56:03,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.71428571428571) internal successors, (859), 7 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:03,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:03,532 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:03,532 INFO L175 Difference]: Start difference. First operand has 68 places, 88 transitions, 677 flow. Second operand 7 states and 859 transitions. [2023-01-28 06:56:03,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 252 transitions, 2425 flow [2023-01-28 06:56:03,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 252 transitions, 2418 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 06:56:03,580 INFO L231 Difference]: Finished difference. Result has 76 places, 94 transitions, 785 flow [2023-01-28 06:56:03,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=785, PETRI_PLACES=76, PETRI_TRANSITIONS=94} [2023-01-28 06:56:03,580 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2023-01-28 06:56:03,580 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 94 transitions, 785 flow [2023-01-28 06:56:03,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:03,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:03,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:03,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:56:03,581 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:03,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:03,581 INFO L85 PathProgramCache]: Analyzing trace with hash -588992852, now seen corresponding path program 1 times [2023-01-28 06:56:03,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:03,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934554863] [2023-01-28 06:56:03,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:03,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:03,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:03,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:03,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934554863] [2023-01-28 06:56:03,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934554863] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:03,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:03,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:56:03,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145856395] [2023-01-28 06:56:03,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:03,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:56:03,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:03,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:56:03,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:56:03,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 244 [2023-01-28 06:56:03,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 94 transitions, 785 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:03,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:03,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 244 [2023-01-28 06:56:03,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:04,517 INFO L130 PetriNetUnfolder]: 4290/6366 cut-off events. [2023-01-28 06:56:04,517 INFO L131 PetriNetUnfolder]: For 33174/33849 co-relation queries the response was YES. [2023-01-28 06:56:04,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31154 conditions, 6366 events. 4290/6366 cut-off events. For 33174/33849 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 36435 event pairs, 353 based on Foata normal form. 381/6577 useless extension candidates. Maximal degree in co-relation 31122. Up to 2043 conditions per place. [2023-01-28 06:56:04,552 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 212 selfloop transitions, 28 changer transitions 26/276 dead transitions. [2023-01-28 06:56:04,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 276 transitions, 2740 flow [2023-01-28 06:56:04,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:56:04,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:56:04,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1104 transitions. [2023-01-28 06:56:04,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027322404371585 [2023-01-28 06:56:04,557 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1104 transitions. [2023-01-28 06:56:04,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1104 transitions. [2023-01-28 06:56:04,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:04,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1104 transitions. [2023-01-28 06:56:04,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.66666666666667) internal successors, (1104), 9 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:04,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 244.0) internal successors, (2440), 10 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:04,567 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 244.0) internal successors, (2440), 10 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:04,567 INFO L175 Difference]: Start difference. First operand has 76 places, 94 transitions, 785 flow. Second operand 9 states and 1104 transitions. [2023-01-28 06:56:04,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 276 transitions, 2740 flow [2023-01-28 06:56:04,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 276 transitions, 2662 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-01-28 06:56:04,731 INFO L231 Difference]: Finished difference. Result has 82 places, 100 transitions, 868 flow [2023-01-28 06:56:04,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=868, PETRI_PLACES=82, PETRI_TRANSITIONS=100} [2023-01-28 06:56:04,732 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2023-01-28 06:56:04,732 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 100 transitions, 868 flow [2023-01-28 06:56:04,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:04,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:04,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:04,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 06:56:04,732 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:04,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:04,733 INFO L85 PathProgramCache]: Analyzing trace with hash 346982524, now seen corresponding path program 1 times [2023-01-28 06:56:04,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:04,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119898096] [2023-01-28 06:56:04,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:04,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:05,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:05,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:05,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119898096] [2023-01-28 06:56:05,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119898096] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:05,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:05,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:56:05,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400636931] [2023-01-28 06:56:05,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:05,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:56:05,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:05,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:56:05,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:56:05,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 244 [2023-01-28 06:56:05,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 100 transitions, 868 flow. Second operand has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:05,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:05,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 244 [2023-01-28 06:56:05,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:06,288 INFO L130 PetriNetUnfolder]: 9249/13205 cut-off events. [2023-01-28 06:56:06,295 INFO L131 PetriNetUnfolder]: For 54428/54428 co-relation queries the response was YES. [2023-01-28 06:56:06,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60861 conditions, 13205 events. 9249/13205 cut-off events. For 54428/54428 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 70984 event pairs, 1592 based on Foata normal form. 13/13218 useless extension candidates. Maximal degree in co-relation 60827. Up to 7887 conditions per place. [2023-01-28 06:56:06,356 INFO L137 encePairwiseOnDemand]: 236/244 looper letters, 134 selfloop transitions, 12 changer transitions 111/257 dead transitions. [2023-01-28 06:56:06,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 257 transitions, 2671 flow [2023-01-28 06:56:06,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:56:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:56:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 691 transitions. [2023-01-28 06:56:06,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4719945355191257 [2023-01-28 06:56:06,363 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 691 transitions. [2023-01-28 06:56:06,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 691 transitions. [2023-01-28 06:56:06,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:06,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 691 transitions. [2023-01-28 06:56:06,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:06,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:06,367 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:06,367 INFO L175 Difference]: Start difference. First operand has 82 places, 100 transitions, 868 flow. Second operand 6 states and 691 transitions. [2023-01-28 06:56:06,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 257 transitions, 2671 flow [2023-01-28 06:56:06,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 257 transitions, 2400 flow, removed 94 selfloop flow, removed 4 redundant places. [2023-01-28 06:56:06,890 INFO L231 Difference]: Finished difference. Result has 86 places, 92 transitions, 766 flow [2023-01-28 06:56:06,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=766, PETRI_PLACES=86, PETRI_TRANSITIONS=92} [2023-01-28 06:56:06,891 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2023-01-28 06:56:06,891 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 92 transitions, 766 flow [2023-01-28 06:56:06,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:06,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:06,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:06,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:56:06,891 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:06,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:06,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1858711788, now seen corresponding path program 2 times [2023-01-28 06:56:06,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:06,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229202868] [2023-01-28 06:56:06,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:06,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:07,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:07,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229202868] [2023-01-28 06:56:07,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229202868] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:07,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:07,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:56:07,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097191714] [2023-01-28 06:56:07,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:07,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:56:07,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:07,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:56:07,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:56:07,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 244 [2023-01-28 06:56:07,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 92 transitions, 766 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 06:56:07,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:07,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 244 [2023-01-28 06:56:07,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:07,471 INFO L130 PetriNetUnfolder]: 2303/3563 cut-off events. [2023-01-28 06:56:07,471 INFO L131 PetriNetUnfolder]: For 16283/16452 co-relation queries the response was YES. [2023-01-28 06:56:07,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16374 conditions, 3563 events. 2303/3563 cut-off events. For 16283/16452 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 19470 event pairs, 338 based on Foata normal form. 97/3582 useless extension candidates. Maximal degree in co-relation 16336. Up to 1383 conditions per place. [2023-01-28 06:56:07,485 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 117 selfloop transitions, 18 changer transitions 29/173 dead transitions. [2023-01-28 06:56:07,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 173 transitions, 1691 flow [2023-01-28 06:56:07,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:56:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:56:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 955 transitions. [2023-01-28 06:56:07,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48924180327868855 [2023-01-28 06:56:07,488 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 955 transitions. [2023-01-28 06:56:07,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 955 transitions. [2023-01-28 06:56:07,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:07,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 955 transitions. [2023-01-28 06:56:07,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.375) internal successors, (955), 8 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:07,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 244.0) internal successors, (2196), 9 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:07,494 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 244.0) internal successors, (2196), 9 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:07,494 INFO L175 Difference]: Start difference. First operand has 86 places, 92 transitions, 766 flow. Second operand 8 states and 955 transitions. [2023-01-28 06:56:07,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 173 transitions, 1691 flow [2023-01-28 06:56:07,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 173 transitions, 1591 flow, removed 37 selfloop flow, removed 7 redundant places. [2023-01-28 06:56:07,534 INFO L231 Difference]: Finished difference. Result has 83 places, 84 transitions, 671 flow [2023-01-28 06:56:07,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=671, PETRI_PLACES=83, PETRI_TRANSITIONS=84} [2023-01-28 06:56:07,535 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places. [2023-01-28 06:56:07,535 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 84 transitions, 671 flow [2023-01-28 06:56:07,536 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 06:56:07,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:07,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:07,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 06:56:07,536 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:07,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:07,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1103512688, now seen corresponding path program 1 times [2023-01-28 06:56:07,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:07,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263659424] [2023-01-28 06:56:07,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:07,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:07,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:07,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:07,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263659424] [2023-01-28 06:56:07,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263659424] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:07,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:07,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:56:07,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346941841] [2023-01-28 06:56:07,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:07,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:56:07,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:07,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:56:07,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:56:07,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 244 [2023-01-28 06:56:07,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 671 flow. Second operand has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:07,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:07,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 244 [2023-01-28 06:56:07,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:08,484 INFO L130 PetriNetUnfolder]: 3583/5306 cut-off events. [2023-01-28 06:56:08,484 INFO L131 PetriNetUnfolder]: For 17823/17823 co-relation queries the response was YES. [2023-01-28 06:56:08,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23366 conditions, 5306 events. 3583/5306 cut-off events. For 17823/17823 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 27157 event pairs, 269 based on Foata normal form. 1/5307 useless extension candidates. Maximal degree in co-relation 23339. Up to 2796 conditions per place. [2023-01-28 06:56:08,501 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 98 selfloop transitions, 4 changer transitions 83/185 dead transitions. [2023-01-28 06:56:08,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 185 transitions, 1814 flow [2023-01-28 06:56:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:56:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:56:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 677 transitions. [2023-01-28 06:56:08,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.462431693989071 [2023-01-28 06:56:08,504 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 677 transitions. [2023-01-28 06:56:08,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 677 transitions. [2023-01-28 06:56:08,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:08,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 677 transitions. [2023-01-28 06:56:08,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:08,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:08,507 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:08,507 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 671 flow. Second operand 6 states and 677 transitions. [2023-01-28 06:56:08,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 185 transitions, 1814 flow [2023-01-28 06:56:08,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 185 transitions, 1628 flow, removed 42 selfloop flow, removed 10 redundant places. [2023-01-28 06:56:08,555 INFO L231 Difference]: Finished difference. Result has 77 places, 68 transitions, 480 flow [2023-01-28 06:56:08,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=480, PETRI_PLACES=77, PETRI_TRANSITIONS=68} [2023-01-28 06:56:08,556 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2023-01-28 06:56:08,556 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 480 flow [2023-01-28 06:56:08,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:08,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:08,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:08,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 06:56:08,556 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:08,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:08,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1251624762, now seen corresponding path program 2 times [2023-01-28 06:56:08,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:08,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201858754] [2023-01-28 06:56:08,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:08,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:08,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:08,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:08,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201858754] [2023-01-28 06:56:08,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201858754] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:08,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:08,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:56:08,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331958540] [2023-01-28 06:56:08,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:08,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:56:08,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:08,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:56:08,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:56:08,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 244 [2023-01-28 06:56:08,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 480 flow. Second operand has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:08,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:08,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 244 [2023-01-28 06:56:08,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:09,058 INFO L130 PetriNetUnfolder]: 2027/3209 cut-off events. [2023-01-28 06:56:09,058 INFO L131 PetriNetUnfolder]: For 11393/11396 co-relation queries the response was YES. [2023-01-28 06:56:09,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14077 conditions, 3209 events. 2027/3209 cut-off events. For 11393/11396 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 17081 event pairs, 581 based on Foata normal form. 1/3159 useless extension candidates. Maximal degree in co-relation 14054. Up to 1354 conditions per place. [2023-01-28 06:56:09,066 INFO L137 encePairwiseOnDemand]: 241/244 looper letters, 51 selfloop transitions, 1 changer transitions 79/135 dead transitions. [2023-01-28 06:56:09,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 135 transitions, 1242 flow [2023-01-28 06:56:09,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:56:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:56:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2023-01-28 06:56:09,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174180327868853 [2023-01-28 06:56:09,067 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 505 transitions. [2023-01-28 06:56:09,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 505 transitions. [2023-01-28 06:56:09,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:09,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 505 transitions. [2023-01-28 06:56:09,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:09,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:09,070 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:09,070 INFO L175 Difference]: Start difference. First operand has 77 places, 68 transitions, 480 flow. Second operand 4 states and 505 transitions. [2023-01-28 06:56:09,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 135 transitions, 1242 flow [2023-01-28 06:56:09,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 135 transitions, 1180 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-01-28 06:56:09,094 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 302 flow [2023-01-28 06:56:09,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=74, PETRI_TRANSITIONS=48} [2023-01-28 06:56:09,096 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2023-01-28 06:56:09,096 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 302 flow [2023-01-28 06:56:09,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:09,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:09,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:09,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 06:56:09,096 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:09,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:09,097 INFO L85 PathProgramCache]: Analyzing trace with hash -385903500, now seen corresponding path program 3 times [2023-01-28 06:56:09,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:09,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176478947] [2023-01-28 06:56:09,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:09,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:56:09,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:56:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:56:09,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:56:09,218 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:56:09,219 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-28 06:56:09,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-28 06:56:09,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-28 06:56:09,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-28 06:56:09,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-28 06:56:09,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-28 06:56:09,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-28 06:56:09,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 06:56:09,222 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:09,226 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:56:09,227 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:56:09,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:56:09 BasicIcfg [2023-01-28 06:56:09,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:56:09,291 INFO L158 Benchmark]: Toolchain (without parser) took 24578.33ms. Allocated memory was 308.3MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 274.8MB in the beginning and 2.3GB in the end (delta: -2.0GB). Peak memory consumption was 149.2MB. Max. memory is 16.0GB. [2023-01-28 06:56:09,291 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:56:09,292 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.53ms. Allocated memory is still 308.3MB. Free memory was 274.8MB in the beginning and 250.7MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 06:56:09,292 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.05ms. Allocated memory is still 308.3MB. Free memory was 250.7MB in the beginning and 248.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:56:09,292 INFO L158 Benchmark]: Boogie Preprocessor took 21.92ms. Allocated memory is still 308.3MB. Free memory was 248.0MB in the beginning and 245.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:56:09,292 INFO L158 Benchmark]: RCFGBuilder took 654.34ms. Allocated memory is still 308.3MB. Free memory was 245.9MB in the beginning and 273.0MB in the end (delta: -27.1MB). Peak memory consumption was 40.3MB. Max. memory is 16.0GB. [2023-01-28 06:56:09,292 INFO L158 Benchmark]: TraceAbstraction took 23383.84ms. Allocated memory was 308.3MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 272.7MB in the beginning and 2.3GB in the end (delta: -2.0GB). Peak memory consumption was 146.7MB. Max. memory is 16.0GB. [2023-01-28 06:56:09,293 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.08ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 458.53ms. Allocated memory is still 308.3MB. Free memory was 274.8MB in the beginning and 250.7MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 54.05ms. Allocated memory is still 308.3MB. Free memory was 250.7MB in the beginning and 248.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 21.92ms. Allocated memory is still 308.3MB. Free memory was 248.0MB in the beginning and 245.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 654.34ms. Allocated memory is still 308.3MB. Free memory was 245.9MB in the beginning and 273.0MB in the end (delta: -27.1MB). Peak memory consumption was 40.3MB. Max. memory is 16.0GB. * TraceAbstraction took 23383.84ms. Allocated memory was 308.3MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 272.7MB in the beginning and 2.3GB in the end (delta: -2.0GB). Peak memory consumption was 146.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 140 PlacesBefore, 43 PlacesAfterwards, 129 TransitionsBefore, 30 TransitionsAfterwards, 3256 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 111 TotalNumberOfCompositions, 9118 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3407, independent: 3160, independent conditional: 0, independent unconditional: 3160, dependent: 247, dependent conditional: 0, dependent unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1756, independent: 1714, independent conditional: 0, independent unconditional: 1714, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3407, independent: 1446, independent conditional: 0, independent unconditional: 1446, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 1756, unknown conditional: 0, unknown unconditional: 1756] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 149, Positive conditional cache size: 0, Positive unconditional cache size: 149, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t993; [L859] FCALL, FORK 0 pthread_create(&t993, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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(&t993, ((void *)0), P0, ((void *)0))=-2, t993={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L860] 0 pthread_t t994; [L861] FCALL, FORK 0 pthread_create(&t994, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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(&t994, ((void *)0), P1, ((void *)0))=-1, t993={5:0}, t994={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L862] 0 pthread_t t995; [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t995, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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(&t995, ((void *)0), P2, ((void *)0))=0, t993={5:0}, t994={6:0}, t995={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L864] 0 pthread_t t996; [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L865] FCALL, FORK 0 pthread_create(&t996, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t996, ((void *)0), P3, ((void *)0))=1, t993={5:0}, t994={6:0}, t995={7:0}, t996={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L824] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L810] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L813] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t993={5:0}, t994={6:0}, t995={7:0}, t996={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - 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: 859]: 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: 861]: 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: 863]: 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: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.2s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 592 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 592 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1743 IncrementalHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 41 mSDtfsCounter, 1743 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=868occurred in iteration=11, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 2490 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 06:56:09,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...