/usr/bin/java -Xmx8000000000 -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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-0612a5f-m [2022-09-20 20:35:45,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 20:35:45,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 20:35:45,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 20:35:45,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 20:35:45,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 20:35:45,404 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 20:35:45,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 20:35:45,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 20:35:45,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 20:35:45,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 20:35:45,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 20:35:45,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 20:35:45,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 20:35:45,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 20:35:45,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 20:35:45,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 20:35:45,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 20:35:45,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 20:35:45,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 20:35:45,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 20:35:45,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 20:35:45,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 20:35:45,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 20:35:45,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 20:35:45,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 20:35:45,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 20:35:45,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 20:35:45,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 20:35:45,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 20:35:45,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 20:35:45,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 20:35:45,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 20:35:45,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 20:35:45,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 20:35:45,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 20:35:45,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 20:35:45,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 20:35:45,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 20:35:45,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 20:35:45,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 20:35:45,426 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-NoLbe.epf [2022-09-20 20:35:45,439 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 20:35:45,439 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 20:35:45,440 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 20:35:45,440 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 20:35:45,440 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 20:35:45,440 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 20:35:45,440 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 20:35:45,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 20:35:45,441 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 20:35:45,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 20:35:45,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 20:35:45,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 20:35:45,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 20:35:45,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 20:35:45,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 20:35:45,442 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 20:35:45,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 20:35:45,442 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 20:35:45,442 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 20:35:45,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 20:35:45,443 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 20:35:45,443 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 20:35:45,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 20:35:45,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 20:35:45,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 20:35:45,443 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 20:35:45,443 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 20:35:45,444 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 20:35:45,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 20:35:45,444 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 20:35:45,444 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 20:35:45,444 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-09-20 20:35:45,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 20:35:45,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 20:35:45,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 20:35:45,611 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 20:35:45,612 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 20:35:45,613 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i [2022-09-20 20:35:45,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2820d55e/e364550bb92d4c2c9d9e5eec8d01d365/FLAG62b13a12b [2022-09-20 20:35:46,088 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 20:35:46,089 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i [2022-09-20 20:35:46,099 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2820d55e/e364550bb92d4c2c9d9e5eec8d01d365/FLAG62b13a12b [2022-09-20 20:35:46,108 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2820d55e/e364550bb92d4c2c9d9e5eec8d01d365 [2022-09-20 20:35:46,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 20:35:46,113 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 20:35:46,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 20:35:46,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 20:35:46,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 20:35:46,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:35:46" (1/1) ... [2022-09-20 20:35:46,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef90bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:46, skipping insertion in model container [2022-09-20 20:35:46,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:35:46" (1/1) ... [2022-09-20 20:35:46,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 20:35:46,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 20:35:46,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i[1001,1014] [2022-09-20 20:35:46,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 20:35:46,458 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 20:35:46,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i[1001,1014] [2022-09-20 20:35:46,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 20:35:46,525 INFO L208 MainTranslator]: Completed translation [2022-09-20 20:35:46,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:46 WrapperNode [2022-09-20 20:35:46,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 20:35:46,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 20:35:46,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 20:35:46,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 20:35:46,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:46" (1/1) ... [2022-09-20 20:35:46,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:46" (1/1) ... [2022-09-20 20:35:46,556 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 179 [2022-09-20 20:35:46,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 20:35:46,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 20:35:46,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 20:35:46,557 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 20:35:46,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:46" (1/1) ... [2022-09-20 20:35:46,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:46" (1/1) ... [2022-09-20 20:35:46,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:46" (1/1) ... [2022-09-20 20:35:46,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:46" (1/1) ... [2022-09-20 20:35:46,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:46" (1/1) ... [2022-09-20 20:35:46,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:46" (1/1) ... [2022-09-20 20:35:46,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:46" (1/1) ... [2022-09-20 20:35:46,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 20:35:46,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 20:35:46,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 20:35:46,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 20:35:46,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:46" (1/1) ... [2022-09-20 20:35:46,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 20:35:46,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 20:35:46,604 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) [2022-09-20 20:35:46,606 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 [2022-09-20 20:35:46,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 20:35:46,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 20:35:46,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 20:35:46,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 20:35:46,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 20:35:46,657 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-09-20 20:35:46,657 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-09-20 20:35:46,657 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-09-20 20:35:46,657 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-09-20 20:35:46,657 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-09-20 20:35:46,657 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-09-20 20:35:46,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 20:35:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 20:35:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 20:35:46,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 20:35:46,673 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 20:35:46,818 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 20:35:46,820 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 20:35:47,232 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 20:35:47,426 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 20:35:47,427 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-20 20:35:47,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:35:47 BoogieIcfgContainer [2022-09-20 20:35:47,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 20:35:47,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 20:35:47,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 20:35:47,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 20:35:47,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 08:35:46" (1/3) ... [2022-09-20 20:35:47,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e3449e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:35:47, skipping insertion in model container [2022-09-20 20:35:47,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:46" (2/3) ... [2022-09-20 20:35:47,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e3449e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:35:47, skipping insertion in model container [2022-09-20 20:35:47,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:35:47" (3/3) ... [2022-09-20 20:35:47,435 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_power.opt_rmo.opt.i [2022-09-20 20:35:47,448 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 20:35:47,448 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-09-20 20:35:47,448 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 20:35:47,504 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-20 20:35:47,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2022-09-20 20:35:47,583 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2022-09-20 20:35:47,583 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 20:35:47,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-09-20 20:35:47,587 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow [2022-09-20 20:35:47,590 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2022-09-20 20:35:47,603 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 20:35:47,611 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;@7ca187b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 20:35:47,611 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-09-20 20:35:47,625 INFO L130 PetriNetUnfolder]: 0/63 cut-off events. [2022-09-20 20:35:47,625 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 20:35:47,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:47,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:47,626 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:35:47,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:47,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1278467929, now seen corresponding path program 1 times [2022-09-20 20:35:47,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:47,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672051891] [2022-09-20 20:35:47,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:47,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:47,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:47,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:47,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672051891] [2022-09-20 20:35:47,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672051891] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:47,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:47,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 20:35:47,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067680424] [2022-09-20 20:35:47,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:47,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 20:35:47,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:47,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 20:35:47,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 20:35:47,858 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 119 [2022-09-20 20:35:47,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 116 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:47,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:47,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 119 [2022-09-20 20:35:47,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:47,972 INFO L130 PetriNetUnfolder]: 37/299 cut-off events. [2022-09-20 20:35:47,972 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-09-20 20:35:47,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 299 events. 37/299 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1145 event pairs, 19 based on Foata normal form. 10/287 useless extension candidates. Maximal degree in co-relation 337. Up to 51 conditions per place. [2022-09-20 20:35:47,977 INFO L137 encePairwiseOnDemand]: 114/119 looper letters, 11 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2022-09-20 20:35:47,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 116 transitions, 270 flow [2022-09-20 20:35:47,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 20:35:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 20:35:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2022-09-20 20:35:47,990 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2022-09-20 20:35:47,991 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2022-09-20 20:35:47,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2022-09-20 20:35:47,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:47,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2022-09-20 20:35:47,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:48,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:48,005 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:48,006 INFO L175 Difference]: Start difference. First operand has 124 places, 116 transitions, 241 flow. Second operand 3 states and 336 transitions. [2022-09-20 20:35:48,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 116 transitions, 270 flow [2022-09-20 20:35:48,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 116 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-09-20 20:35:48,015 INFO L231 Difference]: Finished difference. Result has 121 places, 112 transitions, 234 flow [2022-09-20 20:35:48,016 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=121, PETRI_TRANSITIONS=112} [2022-09-20 20:35:48,021 INFO L287 CegarLoopForPetriNet]: 124 programPoint places, -3 predicate places. [2022-09-20 20:35:48,021 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 112 transitions, 234 flow [2022-09-20 20:35:48,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:48,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:48,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:48,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 20:35:48,022 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:35:48,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:48,023 INFO L85 PathProgramCache]: Analyzing trace with hash 10626553, now seen corresponding path program 1 times [2022-09-20 20:35:48,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:48,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680263303] [2022-09-20 20:35:48,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:48,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:48,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:48,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680263303] [2022-09-20 20:35:48,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680263303] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:48,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:48,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:35:48,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385269669] [2022-09-20 20:35:48,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:48,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:35:48,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:48,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:35:48,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:35:48,216 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 119 [2022-09-20 20:35:48,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 112 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 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) [2022-09-20 20:35:48,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:48,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 119 [2022-09-20 20:35:48,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:48,567 INFO L130 PetriNetUnfolder]: 330/1079 cut-off events. [2022-09-20 20:35:48,569 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-09-20 20:35:48,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1707 conditions, 1079 events. 330/1079 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7090 event pairs, 53 based on Foata normal form. 0/1047 useless extension candidates. Maximal degree in co-relation 1652. Up to 257 conditions per place. [2022-09-20 20:35:48,578 INFO L137 encePairwiseOnDemand]: 113/119 looper letters, 18 selfloop transitions, 2 changer transitions 45/149 dead transitions. [2022-09-20 20:35:48,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 149 transitions, 430 flow [2022-09-20 20:35:48,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:35:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:35:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 938 transitions. [2022-09-20 20:35:48,582 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8758169934640523 [2022-09-20 20:35:48,582 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 938 transitions. [2022-09-20 20:35:48,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 938 transitions. [2022-09-20 20:35:48,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:48,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 938 transitions. [2022-09-20 20:35:48,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 104.22222222222223) internal successors, (938), 9 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:48,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:48,588 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:48,588 INFO L175 Difference]: Start difference. First operand has 121 places, 112 transitions, 234 flow. Second operand 9 states and 938 transitions. [2022-09-20 20:35:48,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 149 transitions, 430 flow [2022-09-20 20:35:48,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 149 transitions, 412 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 20:35:48,592 INFO L231 Difference]: Finished difference. Result has 134 places, 100 transitions, 226 flow [2022-09-20 20:35:48,592 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=226, PETRI_PLACES=134, PETRI_TRANSITIONS=100} [2022-09-20 20:35:48,593 INFO L287 CegarLoopForPetriNet]: 124 programPoint places, 10 predicate places. [2022-09-20 20:35:48,593 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 100 transitions, 226 flow [2022-09-20 20:35:48,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 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) [2022-09-20 20:35:48,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:48,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:48,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 20:35:48,594 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:35:48,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:48,594 INFO L85 PathProgramCache]: Analyzing trace with hash 638407133, now seen corresponding path program 1 times [2022-09-20 20:35:48,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:48,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966458129] [2022-09-20 20:35:48,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:48,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:48,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:48,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966458129] [2022-09-20 20:35:48,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966458129] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:48,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:48,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:35:48,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399200127] [2022-09-20 20:35:48,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:48,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:35:48,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:48,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:35:48,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:35:48,754 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2022-09-20 20:35:48,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 100 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:48,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:48,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2022-09-20 20:35:48,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:49,044 INFO L130 PetriNetUnfolder]: 683/1542 cut-off events. [2022-09-20 20:35:49,044 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-09-20 20:35:49,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 1542 events. 683/1542 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 10220 event pairs, 47 based on Foata normal form. 0/1497 useless extension candidates. Maximal degree in co-relation 2783. Up to 379 conditions per place. [2022-09-20 20:35:49,053 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 28 selfloop transitions, 6 changer transitions 45/160 dead transitions. [2022-09-20 20:35:49,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 160 transitions, 508 flow [2022-09-20 20:35:49,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 20:35:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 20:35:49,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1041 transitions. [2022-09-20 20:35:49,081 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8747899159663866 [2022-09-20 20:35:49,081 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1041 transitions. [2022-09-20 20:35:49,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1041 transitions. [2022-09-20 20:35:49,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:49,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1041 transitions. [2022-09-20 20:35:49,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 104.1) internal successors, (1041), 10 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:49,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:49,085 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:49,085 INFO L175 Difference]: Start difference. First operand has 134 places, 100 transitions, 226 flow. Second operand 10 states and 1041 transitions. [2022-09-20 20:35:49,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 160 transitions, 508 flow [2022-09-20 20:35:49,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 160 transitions, 492 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-09-20 20:35:49,092 INFO L231 Difference]: Finished difference. Result has 123 places, 102 transitions, 264 flow [2022-09-20 20:35:49,092 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=264, PETRI_PLACES=123, PETRI_TRANSITIONS=102} [2022-09-20 20:35:49,094 INFO L287 CegarLoopForPetriNet]: 124 programPoint places, -1 predicate places. [2022-09-20 20:35:49,094 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 102 transitions, 264 flow [2022-09-20 20:35:49,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:49,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:49,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:49,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 20:35:49,095 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:35:49,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:49,096 INFO L85 PathProgramCache]: Analyzing trace with hash 876692943, now seen corresponding path program 1 times [2022-09-20 20:35:49,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:49,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889526188] [2022-09-20 20:35:49,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:49,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:49,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:49,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:49,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889526188] [2022-09-20 20:35:49,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889526188] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:49,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:49,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:35:49,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251289013] [2022-09-20 20:35:49,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:49,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:35:49,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:49,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:35:49,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:35:49,247 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2022-09-20 20:35:49,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 102 transitions, 264 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:49,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:49,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2022-09-20 20:35:49,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:49,453 INFO L130 PetriNetUnfolder]: 249/712 cut-off events. [2022-09-20 20:35:49,453 INFO L131 PetriNetUnfolder]: For 595/599 co-relation queries the response was YES. [2022-09-20 20:35:49,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1762 conditions, 712 events. 249/712 cut-off events. For 595/599 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4025 event pairs, 17 based on Foata normal form. 24/724 useless extension candidates. Maximal degree in co-relation 1699. Up to 160 conditions per place. [2022-09-20 20:35:49,456 INFO L137 encePairwiseOnDemand]: 110/119 looper letters, 33 selfloop transitions, 9 changer transitions 35/158 dead transitions. [2022-09-20 20:35:49,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 158 transitions, 663 flow [2022-09-20 20:35:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 20:35:49,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 20:35:49,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1039 transitions. [2022-09-20 20:35:49,458 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.873109243697479 [2022-09-20 20:35:49,458 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1039 transitions. [2022-09-20 20:35:49,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1039 transitions. [2022-09-20 20:35:49,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:49,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1039 transitions. [2022-09-20 20:35:49,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 103.9) internal successors, (1039), 10 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:49,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:49,462 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:49,462 INFO L175 Difference]: Start difference. First operand has 123 places, 102 transitions, 264 flow. Second operand 10 states and 1039 transitions. [2022-09-20 20:35:49,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 158 transitions, 663 flow [2022-09-20 20:35:49,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 158 transitions, 639 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-09-20 20:35:49,466 INFO L231 Difference]: Finished difference. Result has 127 places, 105 transitions, 332 flow [2022-09-20 20:35:49,466 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=332, PETRI_PLACES=127, PETRI_TRANSITIONS=105} [2022-09-20 20:35:49,466 INFO L287 CegarLoopForPetriNet]: 124 programPoint places, 3 predicate places. [2022-09-20 20:35:49,467 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 105 transitions, 332 flow [2022-09-20 20:35:49,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:49,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:49,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:49,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 20:35:49,467 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:35:49,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:49,468 INFO L85 PathProgramCache]: Analyzing trace with hash -595345961, now seen corresponding path program 1 times [2022-09-20 20:35:49,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:49,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234557077] [2022-09-20 20:35:49,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:49,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:49,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:49,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234557077] [2022-09-20 20:35:49,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234557077] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:49,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:49,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 20:35:49,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830127535] [2022-09-20 20:35:49,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:49,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 20:35:49,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:49,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 20:35:49,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-09-20 20:35:49,571 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 119 [2022-09-20 20:35:49,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 105 transitions, 332 flow. Second operand has 8 states, 8 states have (on average 93.5) internal successors, (748), 8 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:49,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:49,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 119 [2022-09-20 20:35:49,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:49,788 INFO L130 PetriNetUnfolder]: 199/790 cut-off events. [2022-09-20 20:35:49,788 INFO L131 PetriNetUnfolder]: For 999/1053 co-relation queries the response was YES. [2022-09-20 20:35:49,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1869 conditions, 790 events. 199/790 cut-off events. For 999/1053 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4578 event pairs, 24 based on Foata normal form. 20/790 useless extension candidates. Maximal degree in co-relation 1798. Up to 196 conditions per place. [2022-09-20 20:35:49,792 INFO L137 encePairwiseOnDemand]: 111/119 looper letters, 42 selfloop transitions, 4 changer transitions 20/148 dead transitions. [2022-09-20 20:35:49,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 148 transitions, 559 flow [2022-09-20 20:35:49,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-20 20:35:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-09-20 20:35:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 795 transitions. [2022-09-20 20:35:49,794 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8350840336134454 [2022-09-20 20:35:49,795 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 795 transitions. [2022-09-20 20:35:49,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 795 transitions. [2022-09-20 20:35:49,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:49,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 795 transitions. [2022-09-20 20:35:49,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 99.375) internal successors, (795), 8 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:49,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:49,798 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:49,798 INFO L175 Difference]: Start difference. First operand has 127 places, 105 transitions, 332 flow. Second operand 8 states and 795 transitions. [2022-09-20 20:35:49,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 148 transitions, 559 flow [2022-09-20 20:35:49,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 148 transitions, 503 flow, removed 20 selfloop flow, removed 9 redundant places. [2022-09-20 20:35:49,803 INFO L231 Difference]: Finished difference. Result has 126 places, 106 transitions, 299 flow [2022-09-20 20:35:49,803 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=299, PETRI_PLACES=126, PETRI_TRANSITIONS=106} [2022-09-20 20:35:49,804 INFO L287 CegarLoopForPetriNet]: 124 programPoint places, 2 predicate places. [2022-09-20 20:35:49,804 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 106 transitions, 299 flow [2022-09-20 20:35:49,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.5) internal successors, (748), 8 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:49,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:49,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:49,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 20:35:49,805 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:35:49,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:49,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1355216865, now seen corresponding path program 2 times [2022-09-20 20:35:49,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:49,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758325146] [2022-09-20 20:35:49,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:49,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:49,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:49,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:49,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758325146] [2022-09-20 20:35:49,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758325146] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:49,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:49,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 20:35:49,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997368474] [2022-09-20 20:35:49,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:49,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 20:35:49,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:49,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 20:35:49,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 20:35:49,900 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2022-09-20 20:35:49,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 106 transitions, 299 flow. Second operand has 8 states, 8 states have (on average 97.875) internal successors, (783), 8 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:49,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:49,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2022-09-20 20:35:49,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:50,096 INFO L130 PetriNetUnfolder]: 153/542 cut-off events. [2022-09-20 20:35:50,097 INFO L131 PetriNetUnfolder]: For 347/347 co-relation queries the response was YES. [2022-09-20 20:35:50,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 542 events. 153/542 cut-off events. For 347/347 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2811 event pairs, 30 based on Foata normal form. 16/538 useless extension candidates. Maximal degree in co-relation 1220. Up to 86 conditions per place. [2022-09-20 20:35:50,099 INFO L137 encePairwiseOnDemand]: 110/119 looper letters, 21 selfloop transitions, 12 changer transitions 23/138 dead transitions. [2022-09-20 20:35:50,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 138 transitions, 542 flow [2022-09-20 20:35:50,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 20:35:50,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 20:35:50,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1114 transitions. [2022-09-20 20:35:50,102 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.851031321619557 [2022-09-20 20:35:50,102 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1114 transitions. [2022-09-20 20:35:50,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1114 transitions. [2022-09-20 20:35:50,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:50,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1114 transitions. [2022-09-20 20:35:50,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 101.27272727272727) internal successors, (1114), 11 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:50,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 119.0) internal successors, (1428), 12 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:50,106 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 119.0) internal successors, (1428), 12 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:50,106 INFO L175 Difference]: Start difference. First operand has 126 places, 106 transitions, 299 flow. Second operand 11 states and 1114 transitions. [2022-09-20 20:35:50,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 138 transitions, 542 flow [2022-09-20 20:35:50,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 138 transitions, 509 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-09-20 20:35:50,109 INFO L231 Difference]: Finished difference. Result has 133 places, 106 transitions, 324 flow [2022-09-20 20:35:50,110 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=324, PETRI_PLACES=133, PETRI_TRANSITIONS=106} [2022-09-20 20:35:50,110 INFO L287 CegarLoopForPetriNet]: 124 programPoint places, 9 predicate places. [2022-09-20 20:35:50,110 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 106 transitions, 324 flow [2022-09-20 20:35:50,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 97.875) internal successors, (783), 8 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:50,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:50,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:50,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 20:35:50,111 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:35:50,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:50,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1178172172, now seen corresponding path program 1 times [2022-09-20 20:35:50,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:50,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330992499] [2022-09-20 20:35:50,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:50,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:50,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:50,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330992499] [2022-09-20 20:35:50,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330992499] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:50,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:50,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:35:50,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331225428] [2022-09-20 20:35:50,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:50,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:35:50,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:50,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:35:50,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:35:50,197 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2022-09-20 20:35:50,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 106 transitions, 324 flow. Second operand has 7 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:50,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:50,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2022-09-20 20:35:50,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:50,328 INFO L130 PetriNetUnfolder]: 87/472 cut-off events. [2022-09-20 20:35:50,328 INFO L131 PetriNetUnfolder]: For 350/367 co-relation queries the response was YES. [2022-09-20 20:35:50,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 472 events. 87/472 cut-off events. For 350/367 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2526 event pairs, 18 based on Foata normal form. 1/454 useless extension candidates. Maximal degree in co-relation 956. Up to 63 conditions per place. [2022-09-20 20:35:50,331 INFO L137 encePairwiseOnDemand]: 113/119 looper letters, 18 selfloop transitions, 1 changer transitions 11/118 dead transitions. [2022-09-20 20:35:50,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 118 transitions, 410 flow [2022-09-20 20:35:50,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 20:35:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 20:35:50,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 703 transitions. [2022-09-20 20:35:50,332 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.843937575030012 [2022-09-20 20:35:50,332 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 703 transitions. [2022-09-20 20:35:50,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 703 transitions. [2022-09-20 20:35:50,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:50,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 703 transitions. [2022-09-20 20:35:50,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.42857142857143) internal successors, (703), 7 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:50,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:50,335 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:50,335 INFO L175 Difference]: Start difference. First operand has 133 places, 106 transitions, 324 flow. Second operand 7 states and 703 transitions. [2022-09-20 20:35:50,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 118 transitions, 410 flow [2022-09-20 20:35:50,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 118 transitions, 334 flow, removed 19 selfloop flow, removed 15 redundant places. [2022-09-20 20:35:50,338 INFO L231 Difference]: Finished difference. Result has 125 places, 106 transitions, 261 flow [2022-09-20 20:35:50,338 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=125, PETRI_TRANSITIONS=106} [2022-09-20 20:35:50,339 INFO L287 CegarLoopForPetriNet]: 124 programPoint places, 1 predicate places. [2022-09-20 20:35:50,339 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 106 transitions, 261 flow [2022-09-20 20:35:50,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:50,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:50,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:50,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-20 20:35:50,340 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:35:50,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:50,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1019544336, now seen corresponding path program 2 times [2022-09-20 20:35:50,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:50,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095668896] [2022-09-20 20:35:50,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:50,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:50,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:50,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:50,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095668896] [2022-09-20 20:35:50,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095668896] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:50,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:50,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 20:35:50,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598871163] [2022-09-20 20:35:50,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:50,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 20:35:50,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:50,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 20:35:50,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-09-20 20:35:50,468 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2022-09-20 20:35:50,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 106 transitions, 261 flow. Second operand has 8 states, 8 states have (on average 97.375) internal successors, (779), 8 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:50,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:50,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2022-09-20 20:35:50,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:50,618 INFO L130 PetriNetUnfolder]: 59/440 cut-off events. [2022-09-20 20:35:50,618 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-09-20 20:35:50,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 440 events. 59/440 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2336 event pairs, 7 based on Foata normal form. 1/429 useless extension candidates. Maximal degree in co-relation 684. Up to 66 conditions per place. [2022-09-20 20:35:50,620 INFO L137 encePairwiseOnDemand]: 111/119 looper letters, 20 selfloop transitions, 5 changer transitions 8/120 dead transitions. [2022-09-20 20:35:50,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 120 transitions, 369 flow [2022-09-20 20:35:50,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:35:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:35:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 889 transitions. [2022-09-20 20:35:50,621 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8300653594771242 [2022-09-20 20:35:50,622 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 889 transitions. [2022-09-20 20:35:50,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 889 transitions. [2022-09-20 20:35:50,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:50,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 889 transitions. [2022-09-20 20:35:50,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.77777777777777) internal successors, (889), 9 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:50,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:50,625 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:50,625 INFO L175 Difference]: Start difference. First operand has 125 places, 106 transitions, 261 flow. Second operand 9 states and 889 transitions. [2022-09-20 20:35:50,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 120 transitions, 369 flow [2022-09-20 20:35:50,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 120 transitions, 354 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-09-20 20:35:50,627 INFO L231 Difference]: Finished difference. Result has 130 places, 110 transitions, 292 flow [2022-09-20 20:35:50,627 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=292, PETRI_PLACES=130, PETRI_TRANSITIONS=110} [2022-09-20 20:35:50,627 INFO L287 CegarLoopForPetriNet]: 124 programPoint places, 6 predicate places. [2022-09-20 20:35:50,628 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 110 transitions, 292 flow [2022-09-20 20:35:50,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 97.375) internal successors, (779), 8 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:50,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:50,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:50,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-20 20:35:50,628 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:35:50,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:50,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1498035734, now seen corresponding path program 3 times [2022-09-20 20:35:50,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:50,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415478573] [2022-09-20 20:35:50,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:50,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:50,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:50,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415478573] [2022-09-20 20:35:50,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415478573] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:50,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:50,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-20 20:35:50,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581772181] [2022-09-20 20:35:50,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:50,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-20 20:35:50,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:50,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-20 20:35:50,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-09-20 20:35:50,814 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 119 [2022-09-20 20:35:50,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 110 transitions, 292 flow. Second operand has 12 states, 12 states have (on average 92.91666666666667) internal successors, (1115), 12 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:50,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:50,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 119 [2022-09-20 20:35:50,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:51,007 INFO L130 PetriNetUnfolder]: 53/413 cut-off events. [2022-09-20 20:35:51,008 INFO L131 PetriNetUnfolder]: For 85/107 co-relation queries the response was YES. [2022-09-20 20:35:51,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 413 events. 53/413 cut-off events. For 85/107 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2085 event pairs, 5 based on Foata normal form. 9/411 useless extension candidates. Maximal degree in co-relation 734. Up to 42 conditions per place. [2022-09-20 20:35:51,010 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 22 selfloop transitions, 5 changer transitions 11/121 dead transitions. [2022-09-20 20:35:51,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 121 transitions, 414 flow [2022-09-20 20:35:51,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 20:35:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 20:35:51,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1036 transitions. [2022-09-20 20:35:51,012 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7914438502673797 [2022-09-20 20:35:51,012 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1036 transitions. [2022-09-20 20:35:51,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1036 transitions. [2022-09-20 20:35:51,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:51,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1036 transitions. [2022-09-20 20:35:51,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.18181818181819) internal successors, (1036), 11 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:51,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 119.0) internal successors, (1428), 12 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:51,016 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 119.0) internal successors, (1428), 12 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:51,016 INFO L175 Difference]: Start difference. First operand has 130 places, 110 transitions, 292 flow. Second operand 11 states and 1036 transitions. [2022-09-20 20:35:51,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 121 transitions, 414 flow [2022-09-20 20:35:51,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 121 transitions, 400 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-09-20 20:35:51,018 INFO L231 Difference]: Finished difference. Result has 136 places, 108 transitions, 294 flow [2022-09-20 20:35:51,018 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=294, PETRI_PLACES=136, PETRI_TRANSITIONS=108} [2022-09-20 20:35:51,019 INFO L287 CegarLoopForPetriNet]: 124 programPoint places, 12 predicate places. [2022-09-20 20:35:51,019 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 108 transitions, 294 flow [2022-09-20 20:35:51,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 92.91666666666667) internal successors, (1115), 12 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:35:51,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:51,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:51,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-20 20:35:51,020 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:35:51,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:51,020 INFO L85 PathProgramCache]: Analyzing trace with hash 600008700, now seen corresponding path program 4 times [2022-09-20 20:35:51,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:51,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123699242] [2022-09-20 20:35:51,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:51,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 20:35:51,051 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-20 20:35:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 20:35:51,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-20 20:35:51,105 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-09-20 20:35:51,105 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-09-20 20:35:51,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-09-20 20:35:51,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-09-20 20:35:51,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-09-20 20:35:51,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-09-20 20:35:51,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-09-20 20:35:51,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-20 20:35:51,107 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2022-09-20 20:35:51,111 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 20:35:51,112 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 20:35:51,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 08:35:51 BasicIcfg [2022-09-20 20:35:51,236 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 20:35:51,236 INFO L158 Benchmark]: Toolchain (without parser) took 5123.30ms. Allocated memory was 210.8MB in the beginning and 382.7MB in the end (delta: 172.0MB). Free memory was 178.9MB in the beginning and 133.2MB in the end (delta: 45.7MB). Peak memory consumption was 217.4MB. Max. memory is 8.0GB. [2022-09-20 20:35:51,238 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 210.8MB. Free memory is still 169.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 20:35:51,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.76ms. Allocated memory is still 210.8MB. Free memory was 178.7MB in the beginning and 168.8MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-09-20 20:35:51,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.31ms. Allocated memory is still 210.8MB. Free memory was 168.8MB in the beginning and 166.0MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-20 20:35:51,239 INFO L158 Benchmark]: Boogie Preprocessor took 22.36ms. Allocated memory is still 210.8MB. Free memory was 166.0MB in the beginning and 163.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 20:35:51,239 INFO L158 Benchmark]: RCFGBuilder took 849.17ms. Allocated memory was 210.8MB in the beginning and 253.8MB in the end (delta: 43.0MB). Free memory was 163.9MB in the beginning and 194.4MB in the end (delta: -30.5MB). Peak memory consumption was 46.4MB. Max. memory is 8.0GB. [2022-09-20 20:35:51,241 INFO L158 Benchmark]: TraceAbstraction took 3805.48ms. Allocated memory was 253.8MB in the beginning and 382.7MB in the end (delta: 129.0MB). Free memory was 193.9MB in the beginning and 133.2MB in the end (delta: 60.8MB). Peak memory consumption was 189.2MB. Max. memory is 8.0GB. [2022-09-20 20:35:51,244 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.15ms. Allocated memory is still 210.8MB. Free memory is still 169.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 410.76ms. Allocated memory is still 210.8MB. Free memory was 178.7MB in the beginning and 168.8MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.31ms. Allocated memory is still 210.8MB. Free memory was 168.8MB in the beginning and 166.0MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.36ms. Allocated memory is still 210.8MB. Free memory was 166.0MB in the beginning and 163.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 849.17ms. Allocated memory was 210.8MB in the beginning and 253.8MB in the end (delta: 43.0MB). Free memory was 163.9MB in the beginning and 194.4MB in the end (delta: -30.5MB). Peak memory consumption was 46.4MB. Max. memory is 8.0GB. * TraceAbstraction took 3805.48ms. Allocated memory was 253.8MB in the beginning and 382.7MB in the end (delta: 129.0MB). Free memory was 193.9MB in the beginning and 133.2MB in the end (delta: 60.8MB). Peak memory consumption was 189.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L718] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L725] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L726] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L727] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L728] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L729] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L730] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L731] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L732] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L733] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L734] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L735] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L736] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L737] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L738] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L739] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L740] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L742] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L841] 0 pthread_t t916; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t916={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t916, ((void *)0), P0, ((void *)0))=-2, t916={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t917; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t916={5:0}, t917={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t917, ((void *)0), P1, ((void *)0))=-1, t916={5:0}, t917={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t918; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L778] 2 x$w_buff1 = x$w_buff0 [L779] 2 x$w_buff0 = 1 [L780] 2 x$w_buff1_used = x$w_buff0_used [L781] 2 x$w_buff0_used = (_Bool)1 [L782] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L782] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L783] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L784] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L785] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L786] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L787] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t918, ((void *)0), P2, ((void *)0))=0, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L790] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L807] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L810] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L813] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 1 x$flush_delayed = weak$$choice2 [L756] 1 x$mem_tmp = x [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L757] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L758] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L758] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L758] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L758] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L759] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L759] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L759] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L759] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L760] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L760] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L760] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L760] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L761] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L761] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L762] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L762] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L762] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L763] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L763] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 __unbuffered_p0_EAX = x [L765] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L765] 1 x = x$flush_delayed ? x$mem_tmp : x [L766] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L823] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L823] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L852] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L853] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L854] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L854] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L855] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L856] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L856] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L859] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 844]: 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: 842]: 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: 846]: 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 7 procedures, 147 locations, 6 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: 3.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 368 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 368 mSDsluCounter, 394 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 740 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 991 IncrementalHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 83 mSDtfsCounter, 991 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=4, InterpolantAutomatonStates: 78, 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.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 845 NumberOfCodeBlocks, 845 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 743 ConstructedInterpolants, 0 QuantifiedInterpolants, 2798 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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! [2022-09-20 20:35:51,272 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...