/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:47:27,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:47:27,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:47:27,405 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:47:27,406 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:47:27,406 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:47:27,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:47:27,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:47:27,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:47:27,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:47:27,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:47:27,419 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:47:27,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:47:27,422 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:47:27,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:47:27,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:47:27,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:47:27,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:47:27,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:47:27,432 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:47:27,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:47:27,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:47:27,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:47:27,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:47:27,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:47:27,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:47:27,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:47:27,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:47:27,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:47:27,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:47:27,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:47:27,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:47:27,445 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:47:27,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:47:27,447 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:47:27,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:47:27,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:47:27,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:47:27,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:47:27,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:47:27,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:47:27,449 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 00:47:27,470 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:47:27,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:47:27,471 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:47:27,471 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:47:27,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:47:27,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:47:27,472 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:47:27,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:47:27,473 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:47:27,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:47:27,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:47:27,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:47:27,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:47:27,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:47:27,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:47:27,474 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:47:27,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:47:27,474 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:47:27,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:47:27,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:47:27,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:47:27,474 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:47:27,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:47:27,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:47:27,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:47:27,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:47:27,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:47:27,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:47:27,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:47:27,475 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:47:27,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:47:27,475 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:47:27,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:47:27,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:47:27,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:47:27,669 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:47:27,669 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:47:27,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i [2023-01-28 00:47:28,554 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:47:28,839 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:47:28,840 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i [2023-01-28 00:47:28,856 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7ba8201/74a8e6df68a94feb87b82b5cad3f7529/FLAGaec5f8c18 [2023-01-28 00:47:28,868 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7ba8201/74a8e6df68a94feb87b82b5cad3f7529 [2023-01-28 00:47:28,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:47:28,871 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:47:28,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:47:28,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:47:28,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:47:28,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:47:28" (1/1) ... [2023-01-28 00:47:28,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2234664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:28, skipping insertion in model container [2023-01-28 00:47:28,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:47:28" (1/1) ... [2023-01-28 00:47:28,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:47:28,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:47:29,013 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i[995,1008] [2023-01-28 00:47:29,122 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:47:29,130 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:47:29,137 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i[995,1008] [2023-01-28 00:47:29,170 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:47:29,189 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:47:29,190 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:47:29,194 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:47:29,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:29 WrapperNode [2023-01-28 00:47:29,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:47:29,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:47:29,195 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:47:29,195 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:47:29,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:29" (1/1) ... [2023-01-28 00:47:29,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:29" (1/1) ... [2023-01-28 00:47:29,228 INFO L138 Inliner]: procedures = 177, calls = 87, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 188 [2023-01-28 00:47:29,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:47:29,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:47:29,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:47:29,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:47:29,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:29" (1/1) ... [2023-01-28 00:47:29,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:29" (1/1) ... [2023-01-28 00:47:29,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:29" (1/1) ... [2023-01-28 00:47:29,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:29" (1/1) ... [2023-01-28 00:47:29,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:29" (1/1) ... [2023-01-28 00:47:29,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:29" (1/1) ... [2023-01-28 00:47:29,247 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:29" (1/1) ... [2023-01-28 00:47:29,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:29" (1/1) ... [2023-01-28 00:47:29,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:47:29,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:47:29,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:47:29,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:47:29,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:29" (1/1) ... [2023-01-28 00:47:29,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:47:29,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:47:29,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 00:47:29,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 00:47:29,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 00:47:29,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:47:29,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:47:29,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:47:29,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:47:29,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:47:29,302 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:47:29,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:47:29,303 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:47:29,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:47:29,304 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:47:29,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:47:29,304 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-28 00:47:29,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-28 00:47:29,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:47:29,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:47:29,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:47:29,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:47:29,305 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:47:29,485 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:47:29,486 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:47:29,817 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:47:30,084 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:47:30,084 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:47:30,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:47:30 BoogieIcfgContainer [2023-01-28 00:47:30,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:47:30,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:47:30,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:47:30,090 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:47:30,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:47:28" (1/3) ... [2023-01-28 00:47:30,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4beec3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:47:30, skipping insertion in model container [2023-01-28 00:47:30,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:29" (2/3) ... [2023-01-28 00:47:30,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4beec3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:47:30, skipping insertion in model container [2023-01-28 00:47:30,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:47:30" (3/3) ... [2023-01-28 00:47:30,092 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_power.oepc.i [2023-01-28 00:47:30,103 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:47:30,103 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 00:47:30,103 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:47:30,161 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:47:30,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 304 flow [2023-01-28 00:47:30,252 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-01-28 00:47:30,253 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:47:30,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2023-01-28 00:47:30,257 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 142 transitions, 304 flow [2023-01-28 00:47:30,266 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 124 transitions, 260 flow [2023-01-28 00:47:30,268 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:47:30,275 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 124 transitions, 260 flow [2023-01-28 00:47:30,276 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 124 transitions, 260 flow [2023-01-28 00:47:30,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 124 transitions, 260 flow [2023-01-28 00:47:30,300 INFO L130 PetriNetUnfolder]: 1/124 cut-off events. [2023-01-28 00:47:30,300 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:47:30,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 1/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 46 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-28 00:47:30,303 INFO L119 LiptonReduction]: Number of co-enabled transitions 1736 [2023-01-28 00:47:39,496 INFO L134 LiptonReduction]: Checked pairs total: 4038 [2023-01-28 00:47:39,496 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-01-28 00:47:39,513 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:47:39,521 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;@2b7616c4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:47:39,521 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 00:47:39,529 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2023-01-28 00:47:39,529 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:47:39,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:39,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:39,531 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:47:39,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:39,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1476119892, now seen corresponding path program 1 times [2023-01-28 00:47:39,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:39,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032571573] [2023-01-28 00:47:39,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:39,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:39,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:39,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:39,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032571573] [2023-01-28 00:47:39,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032571573] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:39,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:39,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:47:39,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503330183] [2023-01-28 00:47:39,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:39,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:47:39,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:39,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:47:39,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:47:39,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 246 [2023-01-28 00:47:39,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:39,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:39,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 246 [2023-01-28 00:47:39,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:40,375 INFO L130 PetriNetUnfolder]: 2185/3054 cut-off events. [2023-01-28 00:47:40,375 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2023-01-28 00:47:40,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6240 conditions, 3054 events. 2185/3054 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13251 event pairs, 721 based on Foata normal form. 32/3082 useless extension candidates. Maximal degree in co-relation 6228. Up to 2745 conditions per place. [2023-01-28 00:47:40,391 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 36 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2023-01-28 00:47:40,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 179 flow [2023-01-28 00:47:40,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:47:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:47:40,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-01-28 00:47:40,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5663956639566395 [2023-01-28 00:47:40,401 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-01-28 00:47:40,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-01-28 00:47:40,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:40,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-01-28 00:47:40,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:40,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:40,410 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:40,411 INFO L175 Difference]: Start difference. First operand has 36 places, 23 transitions, 58 flow. Second operand 3 states and 418 transitions. [2023-01-28 00:47:40,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 179 flow [2023-01-28 00:47:40,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 172 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 00:47:40,415 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 73 flow [2023-01-28 00:47:40,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2023-01-28 00:47:40,419 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2023-01-28 00:47:40,420 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 73 flow [2023-01-28 00:47:40,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:40,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:40,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:40,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:47:40,422 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:47:40,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:40,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1484921863, now seen corresponding path program 1 times [2023-01-28 00:47:40,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:40,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83437923] [2023-01-28 00:47:40,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:40,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:41,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:41,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83437923] [2023-01-28 00:47:41,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83437923] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:41,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:41,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:47:41,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251364043] [2023-01-28 00:47:41,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:41,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:47:41,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:41,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:47:41,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:47:41,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 246 [2023-01-28 00:47:41,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 73 flow. Second operand has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:41,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:41,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 246 [2023-01-28 00:47:41,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:41,633 INFO L130 PetriNetUnfolder]: 2409/3390 cut-off events. [2023-01-28 00:47:41,633 INFO L131 PetriNetUnfolder]: For 465/466 co-relation queries the response was YES. [2023-01-28 00:47:41,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7575 conditions, 3390 events. 2409/3390 cut-off events. For 465/466 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 14615 event pairs, 614 based on Foata normal form. 20/3409 useless extension candidates. Maximal degree in co-relation 7564. Up to 3007 conditions per place. [2023-01-28 00:47:41,649 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 32 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2023-01-28 00:47:41,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 174 flow [2023-01-28 00:47:41,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:47:41,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:47:41,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-01-28 00:47:41,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46883468834688347 [2023-01-28 00:47:41,651 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-01-28 00:47:41,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-01-28 00:47:41,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:41,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-01-28 00:47:41,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:41,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:41,654 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:41,654 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 73 flow. Second operand 3 states and 346 transitions. [2023-01-28 00:47:41,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 174 flow [2023-01-28 00:47:41,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:47:41,656 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 89 flow [2023-01-28 00:47:41,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2023-01-28 00:47:41,656 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2023-01-28 00:47:41,657 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 89 flow [2023-01-28 00:47:41,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:41,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:41,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:41,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:47:41,657 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:47:41,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:41,658 INFO L85 PathProgramCache]: Analyzing trace with hash 360843286, now seen corresponding path program 1 times [2023-01-28 00:47:41,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:41,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174399557] [2023-01-28 00:47:41,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:41,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:41,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:41,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:41,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174399557] [2023-01-28 00:47:41,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174399557] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:41,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:41,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:47:41,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715409146] [2023-01-28 00:47:41,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:41,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:47:41,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:41,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:47:41,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:47:41,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 246 [2023-01-28 00:47:41,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:41,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:41,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 246 [2023-01-28 00:47:41,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:42,277 INFO L130 PetriNetUnfolder]: 2206/3157 cut-off events. [2023-01-28 00:47:42,277 INFO L131 PetriNetUnfolder]: For 859/860 co-relation queries the response was YES. [2023-01-28 00:47:42,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7353 conditions, 3157 events. 2206/3157 cut-off events. For 859/860 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13913 event pairs, 652 based on Foata normal form. 30/3186 useless extension candidates. Maximal degree in co-relation 7340. Up to 2474 conditions per place. [2023-01-28 00:47:42,291 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 33 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2023-01-28 00:47:42,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 192 flow [2023-01-28 00:47:42,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:47:42,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:47:42,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-01-28 00:47:42,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5650406504065041 [2023-01-28 00:47:42,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-01-28 00:47:42,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-01-28 00:47:42,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:42,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-01-28 00:47:42,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:42,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:42,296 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:42,297 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 89 flow. Second operand 3 states and 417 transitions. [2023-01-28 00:47:42,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 192 flow [2023-01-28 00:47:42,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:47:42,298 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 94 flow [2023-01-28 00:47:42,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-01-28 00:47:42,299 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2023-01-28 00:47:42,299 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 94 flow [2023-01-28 00:47:42,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:42,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:42,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:42,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:47:42,300 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:47:42,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:42,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1698743473, now seen corresponding path program 1 times [2023-01-28 00:47:42,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:42,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611178919] [2023-01-28 00:47:42,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:42,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:42,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:42,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611178919] [2023-01-28 00:47:42,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611178919] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:42,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:42,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:47:42,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021664547] [2023-01-28 00:47:42,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:42,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:47:42,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:42,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:47:42,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:47:42,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 246 [2023-01-28 00:47:42,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:42,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:42,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 246 [2023-01-28 00:47:42,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:43,007 INFO L130 PetriNetUnfolder]: 2772/3905 cut-off events. [2023-01-28 00:47:43,007 INFO L131 PetriNetUnfolder]: For 1522/1523 co-relation queries the response was YES. [2023-01-28 00:47:43,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9530 conditions, 3905 events. 2772/3905 cut-off events. For 1522/1523 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 17348 event pairs, 1957 based on Foata normal form. 40/3944 useless extension candidates. Maximal degree in co-relation 9515. Up to 3406 conditions per place. [2023-01-28 00:47:43,021 INFO L137 encePairwiseOnDemand]: 237/246 looper letters, 29 selfloop transitions, 9 changer transitions 0/40 dead transitions. [2023-01-28 00:47:43,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 204 flow [2023-01-28 00:47:43,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:47:43,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:47:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions. [2023-01-28 00:47:43,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5111788617886179 [2023-01-28 00:47:43,023 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 503 transitions. [2023-01-28 00:47:43,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 503 transitions. [2023-01-28 00:47:43,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:43,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 503 transitions. [2023-01-28 00:47:43,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:43,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:43,026 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:43,026 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 94 flow. Second operand 4 states and 503 transitions. [2023-01-28 00:47:43,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 204 flow [2023-01-28 00:47:43,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:47:43,028 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 144 flow [2023-01-28 00:47:43,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-01-28 00:47:43,028 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2023-01-28 00:47:43,028 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 144 flow [2023-01-28 00:47:43,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:43,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:43,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:43,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:47:43,029 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:47:43,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:43,029 INFO L85 PathProgramCache]: Analyzing trace with hash -679820593, now seen corresponding path program 2 times [2023-01-28 00:47:43,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:43,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057049914] [2023-01-28 00:47:43,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:43,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:43,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:43,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057049914] [2023-01-28 00:47:43,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057049914] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:43,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:43,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:47:43,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077694385] [2023-01-28 00:47:43,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:43,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:47:43,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:43,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:47:43,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:47:43,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 246 [2023-01-28 00:47:43,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:43,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:43,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 246 [2023-01-28 00:47:43,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:43,890 INFO L130 PetriNetUnfolder]: 2861/4038 cut-off events. [2023-01-28 00:47:43,890 INFO L131 PetriNetUnfolder]: For 2605/2606 co-relation queries the response was YES. [2023-01-28 00:47:43,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11850 conditions, 4038 events. 2861/4038 cut-off events. For 2605/2606 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 18222 event pairs, 1957 based on Foata normal form. 40/4077 useless extension candidates. Maximal degree in co-relation 11834. Up to 3440 conditions per place. [2023-01-28 00:47:43,906 INFO L137 encePairwiseOnDemand]: 238/246 looper letters, 30 selfloop transitions, 12 changer transitions 0/44 dead transitions. [2023-01-28 00:47:43,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 266 flow [2023-01-28 00:47:43,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:47:43,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:47:43,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions. [2023-01-28 00:47:43,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071138211382114 [2023-01-28 00:47:43,908 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 499 transitions. [2023-01-28 00:47:43,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 499 transitions. [2023-01-28 00:47:43,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:43,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 499 transitions. [2023-01-28 00:47:43,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:43,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:43,911 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:43,912 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 144 flow. Second operand 4 states and 499 transitions. [2023-01-28 00:47:43,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 266 flow [2023-01-28 00:47:43,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 254 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 00:47:43,916 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 195 flow [2023-01-28 00:47:43,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-01-28 00:47:43,916 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2023-01-28 00:47:43,916 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 195 flow [2023-01-28 00:47:43,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:43,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:43,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:43,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:47:43,917 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:47:43,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:43,917 INFO L85 PathProgramCache]: Analyzing trace with hash -681402399, now seen corresponding path program 1 times [2023-01-28 00:47:43,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:43,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157499949] [2023-01-28 00:47:43,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:43,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:44,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:44,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:44,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157499949] [2023-01-28 00:47:44,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157499949] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:44,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:44,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:47:44,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091571661] [2023-01-28 00:47:44,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:44,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:47:44,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:44,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:47:44,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:47:44,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 246 [2023-01-28 00:47:44,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:44,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:44,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 246 [2023-01-28 00:47:44,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:44,820 INFO L130 PetriNetUnfolder]: 2921/4136 cut-off events. [2023-01-28 00:47:44,820 INFO L131 PetriNetUnfolder]: For 4486/4486 co-relation queries the response was YES. [2023-01-28 00:47:44,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13313 conditions, 4136 events. 2921/4136 cut-off events. For 4486/4486 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 19198 event pairs, 816 based on Foata normal form. 34/4170 useless extension candidates. Maximal degree in co-relation 13296. Up to 3128 conditions per place. [2023-01-28 00:47:44,839 INFO L137 encePairwiseOnDemand]: 239/246 looper letters, 60 selfloop transitions, 12 changer transitions 0/74 dead transitions. [2023-01-28 00:47:44,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 74 transitions, 519 flow [2023-01-28 00:47:44,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:47:44,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:47:44,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 511 transitions. [2023-01-28 00:47:44,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5193089430894309 [2023-01-28 00:47:44,841 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 511 transitions. [2023-01-28 00:47:44,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 511 transitions. [2023-01-28 00:47:44,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:44,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 511 transitions. [2023-01-28 00:47:44,843 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 00:47:44,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:44,844 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:44,844 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 195 flow. Second operand 4 states and 511 transitions. [2023-01-28 00:47:44,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 74 transitions, 519 flow [2023-01-28 00:47:44,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 74 transitions, 492 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 00:47:44,849 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 291 flow [2023-01-28 00:47:44,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=291, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2023-01-28 00:47:44,849 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2023-01-28 00:47:44,849 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 291 flow [2023-01-28 00:47:44,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:44,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:44,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:44,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:47:44,850 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:47:44,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:44,850 INFO L85 PathProgramCache]: Analyzing trace with hash -804150218, now seen corresponding path program 1 times [2023-01-28 00:47:44,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:44,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956289152] [2023-01-28 00:47:44,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:44,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:44,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:44,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:44,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956289152] [2023-01-28 00:47:44,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956289152] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:44,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:44,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:47:44,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56333473] [2023-01-28 00:47:44,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:44,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:47:44,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:44,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:47:44,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:47:44,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 246 [2023-01-28 00:47:44,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 291 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:44,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:44,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 246 [2023-01-28 00:47:44,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:45,567 INFO L130 PetriNetUnfolder]: 3543/5030 cut-off events. [2023-01-28 00:47:45,567 INFO L131 PetriNetUnfolder]: For 10997/11351 co-relation queries the response was YES. [2023-01-28 00:47:45,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17264 conditions, 5030 events. 3543/5030 cut-off events. For 10997/11351 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 25265 event pairs, 1397 based on Foata normal form. 338/5309 useless extension candidates. Maximal degree in co-relation 17245. Up to 3110 conditions per place. [2023-01-28 00:47:45,586 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 64 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2023-01-28 00:47:45,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 544 flow [2023-01-28 00:47:45,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:47:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:47:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-01-28 00:47:45,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5663956639566395 [2023-01-28 00:47:45,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-01-28 00:47:45,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-01-28 00:47:45,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:45,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-01-28 00:47:45,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:45,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:45,590 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:45,590 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 291 flow. Second operand 3 states and 418 transitions. [2023-01-28 00:47:45,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 544 flow [2023-01-28 00:47:45,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 70 transitions, 531 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-01-28 00:47:45,603 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 289 flow [2023-01-28 00:47:45,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=289, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2023-01-28 00:47:45,604 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2023-01-28 00:47:45,604 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 289 flow [2023-01-28 00:47:45,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:45,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:45,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:45,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:47:45,605 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:47:45,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:45,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1723846709, now seen corresponding path program 1 times [2023-01-28 00:47:45,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:45,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236822574] [2023-01-28 00:47:45,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:45,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:45,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:45,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236822574] [2023-01-28 00:47:45,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236822574] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:45,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:45,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:47:45,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342227415] [2023-01-28 00:47:45,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:45,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:47:45,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:45,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:47:45,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:47:45,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 246 [2023-01-28 00:47:45,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 289 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:45,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:45,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 246 [2023-01-28 00:47:45,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:46,399 INFO L130 PetriNetUnfolder]: 2789/4119 cut-off events. [2023-01-28 00:47:46,400 INFO L131 PetriNetUnfolder]: For 10233/10765 co-relation queries the response was YES. [2023-01-28 00:47:46,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14299 conditions, 4119 events. 2789/4119 cut-off events. For 10233/10765 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 21867 event pairs, 477 based on Foata normal form. 702/4804 useless extension candidates. Maximal degree in co-relation 14279. Up to 2855 conditions per place. [2023-01-28 00:47:46,413 INFO L137 encePairwiseOnDemand]: 239/246 looper letters, 64 selfloop transitions, 5 changer transitions 45/119 dead transitions. [2023-01-28 00:47:46,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 119 transitions, 971 flow [2023-01-28 00:47:46,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:47:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:47:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 670 transitions. [2023-01-28 00:47:46,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5447154471544715 [2023-01-28 00:47:46,415 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 670 transitions. [2023-01-28 00:47:46,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 670 transitions. [2023-01-28 00:47:46,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:46,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 670 transitions. [2023-01-28 00:47:46,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:46,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:46,418 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:46,418 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 289 flow. Second operand 5 states and 670 transitions. [2023-01-28 00:47:46,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 119 transitions, 971 flow [2023-01-28 00:47:46,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 119 transitions, 957 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-01-28 00:47:46,425 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 333 flow [2023-01-28 00:47:46,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2023-01-28 00:47:46,427 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2023-01-28 00:47:46,427 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 333 flow [2023-01-28 00:47:46,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:46,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:46,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:46,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:47:46,428 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:47:46,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:46,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1849513484, now seen corresponding path program 1 times [2023-01-28 00:47:46,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:46,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925580838] [2023-01-28 00:47:46,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:46,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:46,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:46,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925580838] [2023-01-28 00:47:46,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925580838] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:46,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:46,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:47:46,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084713013] [2023-01-28 00:47:46,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:46,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:47:46,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:46,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:47:46,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:47:46,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 246 [2023-01-28 00:47:46,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 333 flow. Second operand has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:46,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:46,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 246 [2023-01-28 00:47:46,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:47,056 INFO L130 PetriNetUnfolder]: 1719/2655 cut-off events. [2023-01-28 00:47:47,057 INFO L131 PetriNetUnfolder]: For 7545/7897 co-relation queries the response was YES. [2023-01-28 00:47:47,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11067 conditions, 2655 events. 1719/2655 cut-off events. For 7545/7897 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13894 event pairs, 181 based on Foata normal form. 499/3137 useless extension candidates. Maximal degree in co-relation 11043. Up to 1124 conditions per place. [2023-01-28 00:47:47,066 INFO L137 encePairwiseOnDemand]: 239/246 looper letters, 83 selfloop transitions, 9 changer transitions 42/139 dead transitions. [2023-01-28 00:47:47,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 139 transitions, 1185 flow [2023-01-28 00:47:47,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:47:47,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:47:47,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 806 transitions. [2023-01-28 00:47:47,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5460704607046071 [2023-01-28 00:47:47,069 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 806 transitions. [2023-01-28 00:47:47,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 806 transitions. [2023-01-28 00:47:47,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:47,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 806 transitions. [2023-01-28 00:47:47,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.33333333333334) internal successors, (806), 6 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:47,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:47,074 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:47,074 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 333 flow. Second operand 6 states and 806 transitions. [2023-01-28 00:47:47,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 139 transitions, 1185 flow [2023-01-28 00:47:47,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 139 transitions, 1176 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 00:47:47,086 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 390 flow [2023-01-28 00:47:47,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=390, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2023-01-28 00:47:47,087 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2023-01-28 00:47:47,087 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 390 flow [2023-01-28 00:47:47,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:47,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:47,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:47,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:47:47,088 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:47:47,089 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:47,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1293640085, now seen corresponding path program 1 times [2023-01-28 00:47:47,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:47,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571794553] [2023-01-28 00:47:47,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:47,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:47,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:47,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571794553] [2023-01-28 00:47:47,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571794553] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:47,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:47,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:47:47,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288349265] [2023-01-28 00:47:47,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:47,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:47:47,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:47,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:47:47,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:47:47,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 246 [2023-01-28 00:47:47,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 390 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:47,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:47,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 246 [2023-01-28 00:47:47,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:47,644 INFO L130 PetriNetUnfolder]: 1056/1669 cut-off events. [2023-01-28 00:47:47,644 INFO L131 PetriNetUnfolder]: For 5482/5691 co-relation queries the response was YES. [2023-01-28 00:47:47,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7673 conditions, 1669 events. 1056/1669 cut-off events. For 5482/5691 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8199 event pairs, 120 based on Foata normal form. 267/1919 useless extension candidates. Maximal degree in co-relation 7646. Up to 653 conditions per place. [2023-01-28 00:47:47,651 INFO L137 encePairwiseOnDemand]: 239/246 looper letters, 89 selfloop transitions, 13 changer transitions 31/138 dead transitions. [2023-01-28 00:47:47,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 138 transitions, 1249 flow [2023-01-28 00:47:47,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:47:47,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:47:47,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 940 transitions. [2023-01-28 00:47:47,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5458768873403019 [2023-01-28 00:47:47,653 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 940 transitions. [2023-01-28 00:47:47,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 940 transitions. [2023-01-28 00:47:47,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:47,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 940 transitions. [2023-01-28 00:47:47,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.28571428571428) internal successors, (940), 7 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:47,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:47,658 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:47,658 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 390 flow. Second operand 7 states and 940 transitions. [2023-01-28 00:47:47,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 138 transitions, 1249 flow [2023-01-28 00:47:47,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 138 transitions, 1163 flow, removed 38 selfloop flow, removed 4 redundant places. [2023-01-28 00:47:47,671 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 412 flow [2023-01-28 00:47:47,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=412, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2023-01-28 00:47:47,672 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2023-01-28 00:47:47,672 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 412 flow [2023-01-28 00:47:47,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:47,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:47,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:47,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:47:47,673 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:47:47,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:47,673 INFO L85 PathProgramCache]: Analyzing trace with hash 415453699, now seen corresponding path program 1 times [2023-01-28 00:47:47,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:47,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075473351] [2023-01-28 00:47:47,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:47,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:48,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:48,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:48,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075473351] [2023-01-28 00:47:48,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075473351] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:48,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:48,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:47:48,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244002221] [2023-01-28 00:47:48,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:48,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:47:48,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:48,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:47:48,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:47:48,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 246 [2023-01-28 00:47:48,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 412 flow. Second operand has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:48,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:48,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 246 [2023-01-28 00:47:48,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:48,476 INFO L130 PetriNetUnfolder]: 1373/2199 cut-off events. [2023-01-28 00:47:48,476 INFO L131 PetriNetUnfolder]: For 7570/7578 co-relation queries the response was YES. [2023-01-28 00:47:48,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10124 conditions, 2199 events. 1373/2199 cut-off events. For 7570/7578 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11299 event pairs, 390 based on Foata normal form. 10/2208 useless extension candidates. Maximal degree in co-relation 10096. Up to 1240 conditions per place. [2023-01-28 00:47:48,485 INFO L137 encePairwiseOnDemand]: 236/246 looper letters, 62 selfloop transitions, 12 changer transitions 17/93 dead transitions. [2023-01-28 00:47:48,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 93 transitions, 924 flow [2023-01-28 00:47:48,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:47:48,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:47:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2023-01-28 00:47:48,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5186991869918699 [2023-01-28 00:47:48,487 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 638 transitions. [2023-01-28 00:47:48,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 638 transitions. [2023-01-28 00:47:48,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:48,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 638 transitions. [2023-01-28 00:47:48,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:48,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:48,491 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:48,491 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 412 flow. Second operand 5 states and 638 transitions. [2023-01-28 00:47:48,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 93 transitions, 924 flow [2023-01-28 00:47:48,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 784 flow, removed 47 selfloop flow, removed 5 redundant places. [2023-01-28 00:47:48,506 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 391 flow [2023-01-28 00:47:48,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=391, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-01-28 00:47:48,506 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2023-01-28 00:47:48,506 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 391 flow [2023-01-28 00:47:48,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:48,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:48,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:48,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:47:48,508 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:47:48,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:48,508 INFO L85 PathProgramCache]: Analyzing trace with hash 667282769, now seen corresponding path program 1 times [2023-01-28 00:47:48,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:48,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76000721] [2023-01-28 00:47:48,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:48,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:48,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:48,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:48,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76000721] [2023-01-28 00:47:48,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76000721] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:48,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:48,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:47:48,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244656607] [2023-01-28 00:47:48,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:48,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:47:48,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:48,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:47:48,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:47:48,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 246 [2023-01-28 00:47:48,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 391 flow. Second operand has 7 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:48,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:48,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 246 [2023-01-28 00:47:48,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:49,082 INFO L130 PetriNetUnfolder]: 1145/1818 cut-off events. [2023-01-28 00:47:49,082 INFO L131 PetriNetUnfolder]: For 5585/5702 co-relation queries the response was YES. [2023-01-28 00:47:49,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7770 conditions, 1818 events. 1145/1818 cut-off events. For 5585/5702 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9323 event pairs, 133 based on Foata normal form. 128/1937 useless extension candidates. Maximal degree in co-relation 7743. Up to 682 conditions per place. [2023-01-28 00:47:49,088 INFO L137 encePairwiseOnDemand]: 239/246 looper letters, 71 selfloop transitions, 17 changer transitions 34/124 dead transitions. [2023-01-28 00:47:49,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 124 transitions, 1187 flow [2023-01-28 00:47:49,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 00:47:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 00:47:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1052 transitions. [2023-01-28 00:47:49,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5345528455284553 [2023-01-28 00:47:49,091 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1052 transitions. [2023-01-28 00:47:49,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1052 transitions. [2023-01-28 00:47:49,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:49,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1052 transitions. [2023-01-28 00:47:49,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.5) internal successors, (1052), 8 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:49,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:49,095 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:49,095 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 391 flow. Second operand 8 states and 1052 transitions. [2023-01-28 00:47:49,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 124 transitions, 1187 flow [2023-01-28 00:47:49,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 124 transitions, 1010 flow, removed 46 selfloop flow, removed 6 redundant places. [2023-01-28 00:47:49,111 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 338 flow [2023-01-28 00:47:49,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=338, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2023-01-28 00:47:49,112 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 27 predicate places. [2023-01-28 00:47:49,112 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 338 flow [2023-01-28 00:47:49,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:49,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:49,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:49,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 00:47:49,113 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:47:49,113 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:49,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1972083524, now seen corresponding path program 1 times [2023-01-28 00:47:49,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:49,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644626099] [2023-01-28 00:47:49,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:49,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:49,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:49,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644626099] [2023-01-28 00:47:49,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644626099] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:49,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:49,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:47:49,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005956762] [2023-01-28 00:47:49,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:49,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:47:49,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:49,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:47:49,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:47:49,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 246 [2023-01-28 00:47:49,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:49,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:49,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 246 [2023-01-28 00:47:49,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:49,442 INFO L130 PetriNetUnfolder]: 699/1134 cut-off events. [2023-01-28 00:47:49,442 INFO L131 PetriNetUnfolder]: For 3138/3164 co-relation queries the response was YES. [2023-01-28 00:47:49,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4890 conditions, 1134 events. 699/1134 cut-off events. For 3138/3164 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5152 event pairs, 95 based on Foata normal form. 27/1161 useless extension candidates. Maximal degree in co-relation 4861. Up to 554 conditions per place. [2023-01-28 00:47:49,446 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 49 selfloop transitions, 3 changer transitions 42/95 dead transitions. [2023-01-28 00:47:49,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 95 transitions, 862 flow [2023-01-28 00:47:49,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:47:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:47:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2023-01-28 00:47:49,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5558943089430894 [2023-01-28 00:47:49,448 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 547 transitions. [2023-01-28 00:47:49,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 547 transitions. [2023-01-28 00:47:49,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:49,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 547 transitions. [2023-01-28 00:47:49,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:49,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:49,450 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:49,450 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 338 flow. Second operand 4 states and 547 transitions. [2023-01-28 00:47:49,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 95 transitions, 862 flow [2023-01-28 00:47:49,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 95 transitions, 727 flow, removed 34 selfloop flow, removed 11 redundant places. [2023-01-28 00:47:49,457 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 222 flow [2023-01-28 00:47:49,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-01-28 00:47:49,457 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2023-01-28 00:47:49,458 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 222 flow [2023-01-28 00:47:49,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:47:49,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:49,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:49,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 00:47:49,458 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:47:49,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:49,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1755913742, now seen corresponding path program 2 times [2023-01-28 00:47:49,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:49,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939161212] [2023-01-28 00:47:49,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:49,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:47:49,516 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:47:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:47:49,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:47:49,631 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:47:49,631 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 00:47:49,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-01-28 00:47:49,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 00:47:49,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 00:47:49,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-01-28 00:47:49,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 00:47:49,633 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:49,637 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:47:49,637 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:47:49,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:47:49 BasicIcfg [2023-01-28 00:47:49,714 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:47:49,714 INFO L158 Benchmark]: Toolchain (without parser) took 20843.16ms. Allocated memory was 576.7MB in the beginning and 1.5GB in the end (delta: 893.4MB). Free memory was 533.2MB in the beginning and 1.4GB in the end (delta: -868.6MB). Peak memory consumption was 879.4MB. Max. memory is 16.0GB. [2023-01-28 00:47:49,714 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 375.4MB. Free memory is still 323.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:47:49,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.99ms. Allocated memory is still 576.7MB. Free memory was 533.2MB in the beginning and 507.9MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-28 00:47:49,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.93ms. Allocated memory is still 576.7MB. Free memory was 507.9MB in the beginning and 504.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:47:49,715 INFO L158 Benchmark]: Boogie Preprocessor took 22.43ms. Allocated memory is still 576.7MB. Free memory was 504.9MB in the beginning and 502.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:47:49,715 INFO L158 Benchmark]: RCFGBuilder took 834.73ms. Allocated memory is still 576.7MB. Free memory was 502.2MB in the beginning and 515.6MB in the end (delta: -13.4MB). Peak memory consumption was 76.2MB. Max. memory is 16.0GB. [2023-01-28 00:47:49,715 INFO L158 Benchmark]: TraceAbstraction took 19625.93ms. Allocated memory was 576.7MB in the beginning and 1.5GB in the end (delta: 893.4MB). Free memory was 514.6MB in the beginning and 1.4GB in the end (delta: -887.2MB). Peak memory consumption was 859.8MB. Max. memory is 16.0GB. [2023-01-28 00:47:49,716 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 375.4MB. Free memory is still 323.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 322.99ms. Allocated memory is still 576.7MB. Free memory was 533.2MB in the beginning and 507.9MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 32.93ms. Allocated memory is still 576.7MB. Free memory was 507.9MB in the beginning and 504.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 22.43ms. Allocated memory is still 576.7MB. Free memory was 504.9MB in the beginning and 502.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 834.73ms. Allocated memory is still 576.7MB. Free memory was 502.2MB in the beginning and 515.6MB in the end (delta: -13.4MB). Peak memory consumption was 76.2MB. Max. memory is 16.0GB. * TraceAbstraction took 19625.93ms. Allocated memory was 576.7MB in the beginning and 1.5GB in the end (delta: 893.4MB). Free memory was 514.6MB in the beginning and 1.4GB in the end (delta: -887.2MB). Peak memory consumption was 859.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.2s, 136 PlacesBefore, 36 PlacesAfterwards, 124 TransitionsBefore, 23 TransitionsAfterwards, 1736 CoEnabledTransitionPairs, 8 FixpointIterations, 60 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 104 TotalNumberOfCompositions, 4038 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1574, independent: 1390, independent conditional: 0, independent unconditional: 1390, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 885, independent: 848, independent conditional: 0, independent unconditional: 848, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1574, independent: 542, independent conditional: 0, independent unconditional: 542, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 885, unknown conditional: 0, unknown unconditional: 885] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p2_EAX = 0; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff0_thd4; [L747] 0 _Bool y$r_buff1_thd0; [L748] 0 _Bool y$r_buff1_thd1; [L749] 0 _Bool y$r_buff1_thd2; [L750] 0 _Bool y$r_buff1_thd3; [L751] 0 _Bool y$r_buff1_thd4; [L752] 0 _Bool y$read_delayed; [L753] 0 int *y$read_delayed_var; [L754] 0 int y$w_buff0; [L755] 0 _Bool y$w_buff0_used; [L756] 0 int y$w_buff1; [L757] 0 _Bool y$w_buff1_used; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice1; [L760] 0 _Bool weak$$choice2; [L852] 0 pthread_t t2145; [L853] FCALL, FORK 0 pthread_create(&t2145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2145, ((void *)0), P0, ((void *)0))=-2, t2145={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L854] 0 pthread_t t2146; [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 y$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(y) [L767] 1 y$mem_tmp = y [L768] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L769] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L769] EXPR 1 \read(y) [L769] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L769] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L770] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L771] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L772] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L773] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L777] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L778] EXPR 1 \read(y) [L778] 1 __unbuffered_p0_EAX = y [L779] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L779] EXPR 1 \read(y) [L779] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L779] 1 y = y$flush_delayed ? y$mem_tmp : y [L780] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] FCALL, FORK 0 pthread_create(&t2146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2146, ((void *)0), P1, ((void *)0))=-1, t2145={7:0}, t2146={8:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t2147; [L857] FCALL, FORK 0 pthread_create(&t2147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2147, ((void *)0), P2, ((void *)0))=0, t2145={7:0}, t2146={8:0}, t2147={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L858] 0 pthread_t t2148; [L859] FCALL, FORK 0 pthread_create(&t2148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2148, ((void *)0), P3, ((void *)0))=1, t2145={7:0}, t2146={8:0}, t2147={5:0}, t2148={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L783] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L788] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 1 return 0; [L795] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L807] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L810] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L827] 4 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 \read(y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L831] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L832] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L833] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L834] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L837] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 4 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 \read(y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2145={7:0}, t2146={8:0}, t2147={5:0}, t2148={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] EXPR 0 \read(y) [L875] 0 y$mem_tmp = y [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] EXPR 0 \read(y) [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 x == 2 && y == 2 [L885] EXPR 0 \read(y) [L885] EXPR 0 x == 2 && y == 2 [L885] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L886] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L886] 0 y = y$flush_delayed ? y$mem_tmp : y [L887] 0 y$flush_delayed = (_Bool)0 [L889] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 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: 855]: 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: 853]: 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: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 173 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 295 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 295 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 988 IncrementalHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 7 mSDtfsCounter, 988 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=412occurred in iteration=10, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 1348 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 00:47:49,749 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...