/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-18 22:40:34,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 22:40:34,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 22:40:34,277 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 22:40:34,277 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 22:40:34,287 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 22:40:34,289 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 22:40:34,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 22:40:34,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 22:40:34,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 22:40:34,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 22:40:34,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 22:40:34,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 22:40:34,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 22:40:34,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 22:40:34,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 22:40:34,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 22:40:34,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 22:40:34,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 22:40:34,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 22:40:34,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 22:40:34,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 22:40:34,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 22:40:34,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 22:40:34,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 22:40:34,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 22:40:34,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 22:40:34,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 22:40:34,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 22:40:34,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 22:40:34,325 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 22:40:34,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 22:40:34,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 22:40:34,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 22:40:34,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 22:40:34,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 22:40:34,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 22:40:34,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 22:40:34,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 22:40:34,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 22:40:34,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 22:40:34,330 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-01-18 22:40:34,351 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 22:40:34,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 22:40:34,351 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 22:40:34,352 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 22:40:34,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 22:40:34,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 22:40:34,352 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 22:40:34,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 22:40:34,352 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 22:40:34,352 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 22:40:34,352 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 22:40:34,352 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 22:40:34,353 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 22:40:34,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 22:40:34,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 22:40:34,353 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 22:40:34,353 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 22:40:34,353 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 22:40:34,353 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 22:40:34,353 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 22:40:34,353 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 22:40:34,353 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 22:40:34,353 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 22:40:34,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:40:34,354 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 22:40:34,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 22:40:34,354 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 22:40:34,354 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 22:40:34,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 22:40:34,354 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 22:40:34,354 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-18 22:40:34,354 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-01-18 22:40:34,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 22:40:34,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 22:40:34,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 22:40:34,557 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 22:40:34,571 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 22:40:34,572 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2022-01-18 22:40:34,628 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/153f27fa7/7d2fe8aabf1c47fa959b3049b54b3ca3/FLAG060e06868 [2022-01-18 22:40:35,044 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 22:40:35,044 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2022-01-18 22:40:35,061 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/153f27fa7/7d2fe8aabf1c47fa959b3049b54b3ca3/FLAG060e06868 [2022-01-18 22:40:35,069 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/153f27fa7/7d2fe8aabf1c47fa959b3049b54b3ca3 [2022-01-18 22:40:35,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 22:40:35,071 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 22:40:35,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 22:40:35,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 22:40:35,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 22:40:35,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:40:35" (1/1) ... [2022-01-18 22:40:35,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@558a7473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:35, skipping insertion in model container [2022-01-18 22:40:35,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:40:35" (1/1) ... [2022-01-18 22:40:35,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 22:40:35,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 22:40:35,211 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/mix028_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-01-18 22:40:35,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:40:35,365 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 22:40:35,375 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/mix028_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-01-18 22:40:35,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:40:35,434 INFO L208 MainTranslator]: Completed translation [2022-01-18 22:40:35,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:35 WrapperNode [2022-01-18 22:40:35,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 22:40:35,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 22:40:35,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 22:40:35,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 22:40:35,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:35" (1/1) ... [2022-01-18 22:40:35,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:35" (1/1) ... [2022-01-18 22:40:35,484 INFO L137 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-01-18 22:40:35,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 22:40:35,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 22:40:35,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 22:40:35,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 22:40:35,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:35" (1/1) ... [2022-01-18 22:40:35,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:35" (1/1) ... [2022-01-18 22:40:35,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:35" (1/1) ... [2022-01-18 22:40:35,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:35" (1/1) ... [2022-01-18 22:40:35,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:35" (1/1) ... [2022-01-18 22:40:35,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:35" (1/1) ... [2022-01-18 22:40:35,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:35" (1/1) ... [2022-01-18 22:40:35,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 22:40:35,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 22:40:35,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 22:40:35,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 22:40:35,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:35" (1/1) ... [2022-01-18 22:40:35,535 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:40:35,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 22:40:35,550 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-01-18 22:40:35,573 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-01-18 22:40:35,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 22:40:35,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 22:40:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 22:40:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 22:40:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 22:40:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-18 22:40:35,582 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-18 22:40:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-18 22:40:35,582 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-18 22:40:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-18 22:40:35,582 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-18 22:40:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 22:40:35,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 22:40:35,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 22:40:35,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 22:40:35,587 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 22:40:35,722 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 22:40:35,723 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 22:40:36,042 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 22:40:36,293 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 22:40:36,293 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-18 22:40:36,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:40:36 BoogieIcfgContainer [2022-01-18 22:40:36,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 22:40:36,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 22:40:36,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 22:40:36,299 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 22:40:36,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 10:40:35" (1/3) ... [2022-01-18 22:40:36,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15364556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:40:36, skipping insertion in model container [2022-01-18 22:40:36,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:35" (2/3) ... [2022-01-18 22:40:36,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15364556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:40:36, skipping insertion in model container [2022-01-18 22:40:36,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:40:36" (3/3) ... [2022-01-18 22:40:36,301 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_power.oepc_pso.oepc_rmo.oepc.i [2022-01-18 22:40:36,304 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 22:40:36,304 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-18 22:40:36,304 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 22:40:36,340 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,340 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,340 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,341 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,341 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,341 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,341 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,341 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,341 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,341 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,342 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,342 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,342 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,342 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,343 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,343 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,343 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,343 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,343 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,344 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,344 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,344 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,344 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,345 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,345 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,345 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,345 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,345 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,345 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,345 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,346 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,346 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,346 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,346 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,346 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,346 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,346 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,347 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,347 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,347 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,347 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,347 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,347 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,347 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,347 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,347 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,347 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,347 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,348 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,348 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,348 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,348 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,348 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,348 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,349 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,349 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,349 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,349 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,349 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,350 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,350 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,350 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,350 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,350 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,350 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,350 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,350 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,350 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,350 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,351 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,351 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,351 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,351 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,351 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,351 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,351 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,351 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,351 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,351 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,352 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,352 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,352 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,352 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,352 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,352 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,352 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,352 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,353 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,353 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,353 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,354 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,354 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,356 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,360 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,360 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,360 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,360 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,360 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,360 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,361 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,361 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,361 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,361 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,361 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,361 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,361 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,363 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,363 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,363 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,363 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,363 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,363 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,363 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,363 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,363 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,363 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,363 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,363 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,363 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,363 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,364 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,364 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,364 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,364 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,364 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,364 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,367 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,367 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,367 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,367 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,367 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,367 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,367 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,371 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,371 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,371 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,371 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,371 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,371 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,371 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,372 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,372 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,372 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,372 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,374 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,374 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,374 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,374 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,374 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,374 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,374 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,374 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,375 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,375 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,375 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,375 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,375 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,375 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,375 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,375 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,375 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,375 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,375 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,375 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,375 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,376 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,376 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,376 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,376 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,376 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,376 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,376 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,376 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,376 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,376 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,376 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,377 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,377 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,377 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,378 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,378 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,378 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,378 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,378 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,378 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,378 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,378 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,378 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,378 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,378 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,378 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,379 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,379 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,379 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,379 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,379 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,379 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,379 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,379 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:36,379 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-18 22:40:36,415 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 22:40:36,426 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 22:40:36,427 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-18 22:40:36,435 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2022-01-18 22:40:36,477 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2022-01-18 22:40:36,477 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:40:36,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-01-18 22:40:36,480 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow [2022-01-18 22:40:36,484 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow [2022-01-18 22:40:36,491 INFO L129 PetriNetUnfolder]: 0/45 cut-off events. [2022-01-18 22:40:36,491 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:40:36,492 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:36,492 INFO L254 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] [2022-01-18 22:40:36,492 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:36,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:36,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1707045004, now seen corresponding path program 1 times [2022-01-18 22:40:36,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:36,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667160403] [2022-01-18 22:40:36,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:36,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:40:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:40:36,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:40:36,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667160403] [2022-01-18 22:40:36,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667160403] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:40:36,700 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:40:36,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 22:40:36,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747887340] [2022-01-18 22:40:36,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:40:36,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 22:40:36,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:40:36,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 22:40:36,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 22:40:36,741 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 116 [2022-01-18 22:40:36,746 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 113 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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-01-18 22:40:36,746 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:40:36,746 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 116 [2022-01-18 22:40:36,747 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:40:36,876 INFO L129 PetriNetUnfolder]: 58/277 cut-off events. [2022-01-18 22:40:36,876 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-01-18 22:40:36,878 INFO L84 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 277 events. 58/277 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1105 event pairs, 10 based on Foata normal form. 20/279 useless extension candidates. Maximal degree in co-relation 354. Up to 79 conditions per place. [2022-01-18 22:40:36,881 INFO L132 encePairwiseOnDemand]: 111/116 looper letters, 14 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2022-01-18 22:40:36,882 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 115 transitions, 277 flow [2022-01-18 22:40:36,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 22:40:36,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-18 22:40:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2022-01-18 22:40:36,897 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9396551724137931 [2022-01-18 22:40:36,898 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2022-01-18 22:40:36,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2022-01-18 22:40:36,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:40:36,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2022-01-18 22:40:36,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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-01-18 22:40:36,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 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-01-18 22:40:36,912 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 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-01-18 22:40:36,914 INFO L186 Difference]: Start difference. First operand has 121 places, 113 transitions, 235 flow. Second operand 3 states and 327 transitions. [2022-01-18 22:40:36,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 115 transitions, 277 flow [2022-01-18 22:40:36,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 115 transitions, 272 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-18 22:40:36,921 INFO L242 Difference]: Finished difference. Result has 118 places, 109 transitions, 228 flow [2022-01-18 22:40:36,923 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=118, PETRI_TRANSITIONS=109} [2022-01-18 22:40:36,926 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, -3 predicate places. [2022-01-18 22:40:36,926 INFO L470 AbstractCegarLoop]: Abstraction has has 118 places, 109 transitions, 228 flow [2022-01-18 22:40:36,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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-01-18 22:40:36,926 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:36,927 INFO L254 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] [2022-01-18 22:40:36,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 22:40:36,927 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:36,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:36,927 INFO L85 PathProgramCache]: Analyzing trace with hash -499311708, now seen corresponding path program 1 times [2022-01-18 22:40:36,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:36,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571367712] [2022-01-18 22:40:36,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:36,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:40:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:40:37,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:40:37,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571367712] [2022-01-18 22:40:37,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571367712] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:40:37,194 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:40:37,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:40:37,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474037991] [2022-01-18 22:40:37,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:40:37,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:40:37,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:40:37,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:40:37,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:40:37,198 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116 [2022-01-18 22:40:37,199 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 109 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 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-01-18 22:40:37,199 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:40:37,199 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116 [2022-01-18 22:40:37,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:40:38,311 INFO L129 PetriNetUnfolder]: 3466/8463 cut-off events. [2022-01-18 22:40:38,311 INFO L130 PetriNetUnfolder]: For 363/363 co-relation queries the response was YES. [2022-01-18 22:40:38,323 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14035 conditions, 8463 events. 3466/8463 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 79088 event pairs, 687 based on Foata normal form. 0/8202 useless extension candidates. Maximal degree in co-relation 13980. Up to 1785 conditions per place. [2022-01-18 22:40:38,337 INFO L132 encePairwiseOnDemand]: 103/116 looper letters, 31 selfloop transitions, 9 changer transitions 82/195 dead transitions. [2022-01-18 22:40:38,337 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 195 transitions, 638 flow [2022-01-18 22:40:38,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:40:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:40:38,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 896 transitions. [2022-01-18 22:40:38,340 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8582375478927203 [2022-01-18 22:40:38,340 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 896 transitions. [2022-01-18 22:40:38,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 896 transitions. [2022-01-18 22:40:38,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:40:38,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 896 transitions. [2022-01-18 22:40:38,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.55555555555556) internal successors, (896), 9 states have internal predecessors, (896), 0 states have call successors, (0), 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-01-18 22:40:38,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 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-01-18 22:40:38,346 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 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-01-18 22:40:38,346 INFO L186 Difference]: Start difference. First operand has 118 places, 109 transitions, 228 flow. Second operand 9 states and 896 transitions. [2022-01-18 22:40:38,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 195 transitions, 638 flow [2022-01-18 22:40:38,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 195 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-18 22:40:38,351 INFO L242 Difference]: Finished difference. Result has 132 places, 103 transitions, 310 flow [2022-01-18 22:40:38,351 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=310, PETRI_PLACES=132, PETRI_TRANSITIONS=103} [2022-01-18 22:40:38,352 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 11 predicate places. [2022-01-18 22:40:38,352 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 103 transitions, 310 flow [2022-01-18 22:40:38,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 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-01-18 22:40:38,352 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:38,353 INFO L254 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] [2022-01-18 22:40:38,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 22:40:38,353 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:38,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:38,353 INFO L85 PathProgramCache]: Analyzing trace with hash 763635269, now seen corresponding path program 1 times [2022-01-18 22:40:38,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:38,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207212427] [2022-01-18 22:40:38,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:38,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:40:38,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:40:38,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:40:38,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207212427] [2022-01-18 22:40:38,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207212427] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:40:38,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:40:38,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:40:38,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153304297] [2022-01-18 22:40:38,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:40:38,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:40:38,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:40:38,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:40:38,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:40:38,512 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116 [2022-01-18 22:40:38,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 103 transitions, 310 flow. Second operand has 7 states, 7 states have (on average 89.14285714285714) internal successors, (624), 7 states have internal predecessors, (624), 0 states have call successors, (0), 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-01-18 22:40:38,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:40:38,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116 [2022-01-18 22:40:38,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:40:39,181 INFO L129 PetriNetUnfolder]: 2329/4585 cut-off events. [2022-01-18 22:40:39,181 INFO L130 PetriNetUnfolder]: For 6993/6993 co-relation queries the response was YES. [2022-01-18 22:40:39,190 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13241 conditions, 4585 events. 2329/4585 cut-off events. For 6993/6993 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 33679 event pairs, 317 based on Foata normal form. 126/4599 useless extension candidates. Maximal degree in co-relation 13174. Up to 1031 conditions per place. [2022-01-18 22:40:39,202 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 42 selfloop transitions, 7 changer transitions 97/219 dead transitions. [2022-01-18 22:40:39,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 219 transitions, 1232 flow [2022-01-18 22:40:39,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 22:40:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-18 22:40:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1260 transitions. [2022-01-18 22:40:39,205 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8355437665782494 [2022-01-18 22:40:39,205 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1260 transitions. [2022-01-18 22:40:39,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1260 transitions. [2022-01-18 22:40:39,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:40:39,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1260 transitions. [2022-01-18 22:40:39,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.92307692307692) internal successors, (1260), 13 states have internal predecessors, (1260), 0 states have call successors, (0), 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-01-18 22:40:39,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 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-01-18 22:40:39,210 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 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-01-18 22:40:39,210 INFO L186 Difference]: Start difference. First operand has 132 places, 103 transitions, 310 flow. Second operand 13 states and 1260 transitions. [2022-01-18 22:40:39,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 219 transitions, 1232 flow [2022-01-18 22:40:39,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 219 transitions, 1146 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-01-18 22:40:39,219 INFO L242 Difference]: Finished difference. Result has 136 places, 106 transitions, 374 flow [2022-01-18 22:40:39,220 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=374, PETRI_PLACES=136, PETRI_TRANSITIONS=106} [2022-01-18 22:40:39,220 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 15 predicate places. [2022-01-18 22:40:39,220 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 106 transitions, 374 flow [2022-01-18 22:40:39,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.14285714285714) internal successors, (624), 7 states have internal predecessors, (624), 0 states have call successors, (0), 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-01-18 22:40:39,221 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:39,221 INFO L254 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-01-18 22:40:39,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 22:40:39,221 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:39,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:39,221 INFO L85 PathProgramCache]: Analyzing trace with hash 141854691, now seen corresponding path program 1 times [2022-01-18 22:40:39,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:39,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449764053] [2022-01-18 22:40:39,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:39,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:40:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:40:39,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:40:39,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449764053] [2022-01-18 22:40:39,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449764053] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:40:39,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:40:39,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:40:39,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043095684] [2022-01-18 22:40:39,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:40:39,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:40:39,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:40:39,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:40:39,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:40:39,307 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116 [2022-01-18 22:40:39,308 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 106 transitions, 374 flow. Second operand has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 0 states have call successors, (0), 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-01-18 22:40:39,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:40:39,308 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116 [2022-01-18 22:40:39,308 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:40:39,936 INFO L129 PetriNetUnfolder]: 1728/3342 cut-off events. [2022-01-18 22:40:39,936 INFO L130 PetriNetUnfolder]: For 10396/10396 co-relation queries the response was YES. [2022-01-18 22:40:39,949 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11285 conditions, 3342 events. 1728/3342 cut-off events. For 10396/10396 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 22690 event pairs, 277 based on Foata normal form. 74/3307 useless extension candidates. Maximal degree in co-relation 11208. Up to 980 conditions per place. [2022-01-18 22:40:40,001 INFO L132 encePairwiseOnDemand]: 103/116 looper letters, 39 selfloop transitions, 17 changer transitions 73/202 dead transitions. [2022-01-18 22:40:40,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 202 transitions, 1222 flow [2022-01-18 22:40:40,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 22:40:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-18 22:40:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1257 transitions. [2022-01-18 22:40:40,004 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.833554376657825 [2022-01-18 22:40:40,004 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1257 transitions. [2022-01-18 22:40:40,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1257 transitions. [2022-01-18 22:40:40,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:40:40,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1257 transitions. [2022-01-18 22:40:40,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.6923076923077) internal successors, (1257), 13 states have internal predecessors, (1257), 0 states have call successors, (0), 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-01-18 22:40:40,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 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-01-18 22:40:40,009 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 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-01-18 22:40:40,009 INFO L186 Difference]: Start difference. First operand has 136 places, 106 transitions, 374 flow. Second operand 13 states and 1257 transitions. [2022-01-18 22:40:40,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 202 transitions, 1222 flow [2022-01-18 22:40:40,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 202 transitions, 1142 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-01-18 22:40:40,033 INFO L242 Difference]: Finished difference. Result has 146 places, 112 transitions, 491 flow [2022-01-18 22:40:40,033 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=491, PETRI_PLACES=146, PETRI_TRANSITIONS=112} [2022-01-18 22:40:40,033 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 25 predicate places. [2022-01-18 22:40:40,033 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 112 transitions, 491 flow [2022-01-18 22:40:40,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 0 states have call successors, (0), 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-01-18 22:40:40,034 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:40,034 INFO L254 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] [2022-01-18 22:40:40,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 22:40:40,034 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:40,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:40,034 INFO L85 PathProgramCache]: Analyzing trace with hash -601261670, now seen corresponding path program 1 times [2022-01-18 22:40:40,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:40,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186119478] [2022-01-18 22:40:40,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:40,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:40:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:40:40,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:40:40,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186119478] [2022-01-18 22:40:40,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186119478] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:40:40,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:40:40,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:40:40,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642914450] [2022-01-18 22:40:40,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:40:40,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:40:40,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:40:40,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:40:40,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:40:40,097 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 116 [2022-01-18 22:40:40,097 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 112 transitions, 491 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 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-01-18 22:40:40,097 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:40:40,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 116 [2022-01-18 22:40:40,098 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:40:40,742 INFO L129 PetriNetUnfolder]: 2758/5760 cut-off events. [2022-01-18 22:40:40,743 INFO L130 PetriNetUnfolder]: For 7800/9405 co-relation queries the response was YES. [2022-01-18 22:40:40,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13898 conditions, 5760 events. 2758/5760 cut-off events. For 7800/9405 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 47557 event pairs, 168 based on Foata normal form. 35/5515 useless extension candidates. Maximal degree in co-relation 13812. Up to 1472 conditions per place. [2022-01-18 22:40:40,784 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 78 selfloop transitions, 17 changer transitions 0/186 dead transitions. [2022-01-18 22:40:40,784 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 186 transitions, 952 flow [2022-01-18 22:40:40,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:40:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:40:40,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1009 transitions. [2022-01-18 22:40:40,786 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8698275862068966 [2022-01-18 22:40:40,786 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1009 transitions. [2022-01-18 22:40:40,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1009 transitions. [2022-01-18 22:40:40,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:40:40,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1009 transitions. [2022-01-18 22:40:40,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.9) internal successors, (1009), 10 states have internal predecessors, (1009), 0 states have call successors, (0), 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-01-18 22:40:40,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 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-01-18 22:40:40,790 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 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-01-18 22:40:40,790 INFO L186 Difference]: Start difference. First operand has 146 places, 112 transitions, 491 flow. Second operand 10 states and 1009 transitions. [2022-01-18 22:40:40,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 186 transitions, 952 flow [2022-01-18 22:40:40,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 186 transitions, 890 flow, removed 31 selfloop flow, removed 15 redundant places. [2022-01-18 22:40:40,800 INFO L242 Difference]: Finished difference. Result has 137 places, 127 transitions, 549 flow [2022-01-18 22:40:40,800 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=549, PETRI_PLACES=137, PETRI_TRANSITIONS=127} [2022-01-18 22:40:40,800 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 16 predicate places. [2022-01-18 22:40:40,800 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 127 transitions, 549 flow [2022-01-18 22:40:40,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 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-01-18 22:40:40,801 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:40,801 INFO L254 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] [2022-01-18 22:40:40,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 22:40:40,801 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:40,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:40,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1692991408, now seen corresponding path program 1 times [2022-01-18 22:40:40,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:40,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608372035] [2022-01-18 22:40:40,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:40,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:40:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:40:40,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:40:40,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608372035] [2022-01-18 22:40:40,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608372035] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:40:40,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:40:40,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:40:40,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410623485] [2022-01-18 22:40:40,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:40:40,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:40:40,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:40:40,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:40:40,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:40:40,877 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116 [2022-01-18 22:40:40,878 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 127 transitions, 549 flow. Second operand has 7 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 0 states have call successors, (0), 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-01-18 22:40:40,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:40:40,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116 [2022-01-18 22:40:40,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:40:41,461 INFO L129 PetriNetUnfolder]: 1397/4446 cut-off events. [2022-01-18 22:40:41,461 INFO L130 PetriNetUnfolder]: For 7037/7382 co-relation queries the response was YES. [2022-01-18 22:40:41,479 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12399 conditions, 4446 events. 1397/4446 cut-off events. For 7037/7382 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 44540 event pairs, 249 based on Foata normal form. 114/4321 useless extension candidates. Maximal degree in co-relation 12316. Up to 623 conditions per place. [2022-01-18 22:40:41,491 INFO L132 encePairwiseOnDemand]: 103/116 looper letters, 68 selfloop transitions, 32 changer transitions 24/212 dead transitions. [2022-01-18 22:40:41,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 212 transitions, 1270 flow [2022-01-18 22:40:41,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 22:40:41,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-18 22:40:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1243 transitions. [2022-01-18 22:40:41,493 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8242705570291777 [2022-01-18 22:40:41,493 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1243 transitions. [2022-01-18 22:40:41,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1243 transitions. [2022-01-18 22:40:41,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:40:41,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1243 transitions. [2022-01-18 22:40:41,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.61538461538461) internal successors, (1243), 13 states have internal predecessors, (1243), 0 states have call successors, (0), 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-01-18 22:40:41,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 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-01-18 22:40:41,498 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 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-01-18 22:40:41,498 INFO L186 Difference]: Start difference. First operand has 137 places, 127 transitions, 549 flow. Second operand 13 states and 1243 transitions. [2022-01-18 22:40:41,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 212 transitions, 1270 flow [2022-01-18 22:40:41,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 212 transitions, 1268 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-18 22:40:41,519 INFO L242 Difference]: Finished difference. Result has 160 places, 145 transitions, 878 flow [2022-01-18 22:40:41,520 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=878, PETRI_PLACES=160, PETRI_TRANSITIONS=145} [2022-01-18 22:40:41,520 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 39 predicate places. [2022-01-18 22:40:41,520 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 145 transitions, 878 flow [2022-01-18 22:40:41,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 0 states have call successors, (0), 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-01-18 22:40:41,521 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:41,521 INFO L254 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] [2022-01-18 22:40:41,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 22:40:41,521 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:41,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:41,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1407318598, now seen corresponding path program 1 times [2022-01-18 22:40:41,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:41,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753481261] [2022-01-18 22:40:41,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:41,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:40:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:40:41,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:40:41,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753481261] [2022-01-18 22:40:41,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753481261] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:40:41,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:40:41,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:40:41,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832525727] [2022-01-18 22:40:41,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:40:41,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:40:41,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:40:41,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:40:41,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:40:41,590 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116 [2022-01-18 22:40:41,591 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 145 transitions, 878 flow. Second operand has 7 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 0 states have call successors, (0), 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-01-18 22:40:41,591 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:40:41,591 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116 [2022-01-18 22:40:41,591 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:40:42,295 INFO L129 PetriNetUnfolder]: 1936/6103 cut-off events. [2022-01-18 22:40:42,295 INFO L130 PetriNetUnfolder]: For 18334/18906 co-relation queries the response was YES. [2022-01-18 22:40:42,322 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19021 conditions, 6103 events. 1936/6103 cut-off events. For 18334/18906 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 65040 event pairs, 381 based on Foata normal form. 120/5864 useless extension candidates. Maximal degree in co-relation 18921. Up to 1033 conditions per place. [2022-01-18 22:40:42,332 INFO L132 encePairwiseOnDemand]: 103/116 looper letters, 62 selfloop transitions, 26 changer transitions 24/200 dead transitions. [2022-01-18 22:40:42,332 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 200 transitions, 1515 flow [2022-01-18 22:40:42,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 22:40:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-18 22:40:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 686 transitions. [2022-01-18 22:40:42,333 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8448275862068966 [2022-01-18 22:40:42,333 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 686 transitions. [2022-01-18 22:40:42,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 686 transitions. [2022-01-18 22:40:42,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:40:42,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 686 transitions. [2022-01-18 22:40:42,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 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-01-18 22:40:42,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 116.0) internal successors, (928), 8 states have internal predecessors, (928), 0 states have call successors, (0), 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-01-18 22:40:42,336 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 116.0) internal successors, (928), 8 states have internal predecessors, (928), 0 states have call successors, (0), 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-01-18 22:40:42,336 INFO L186 Difference]: Start difference. First operand has 160 places, 145 transitions, 878 flow. Second operand 7 states and 686 transitions. [2022-01-18 22:40:42,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 200 transitions, 1515 flow [2022-01-18 22:40:42,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 200 transitions, 1475 flow, removed 20 selfloop flow, removed 0 redundant places. [2022-01-18 22:40:42,392 INFO L242 Difference]: Finished difference. Result has 170 places, 148 transitions, 953 flow [2022-01-18 22:40:42,392 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=953, PETRI_PLACES=170, PETRI_TRANSITIONS=148} [2022-01-18 22:40:42,393 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 49 predicate places. [2022-01-18 22:40:42,393 INFO L470 AbstractCegarLoop]: Abstraction has has 170 places, 148 transitions, 953 flow [2022-01-18 22:40:42,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 0 states have call successors, (0), 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-01-18 22:40:42,393 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:42,393 INFO L254 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] [2022-01-18 22:40:42,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 22:40:42,393 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:42,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:42,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1148741502, now seen corresponding path program 2 times [2022-01-18 22:40:42,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:42,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163995357] [2022-01-18 22:40:42,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:42,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:40:42,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:40:42,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:40:42,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163995357] [2022-01-18 22:40:42,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163995357] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:40:42,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:40:42,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:40:42,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398084429] [2022-01-18 22:40:42,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:40:42,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:40:42,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:40:42,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:40:42,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:40:42,454 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 116 [2022-01-18 22:40:42,454 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 148 transitions, 953 flow. Second operand has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 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-01-18 22:40:42,454 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:40:42,455 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 116 [2022-01-18 22:40:42,455 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:40:43,779 INFO L129 PetriNetUnfolder]: 5226/10854 cut-off events. [2022-01-18 22:40:43,779 INFO L130 PetriNetUnfolder]: For 26320/29718 co-relation queries the response was YES. [2022-01-18 22:40:43,898 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34295 conditions, 10854 events. 5226/10854 cut-off events. For 26320/29718 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 102624 event pairs, 321 based on Foata normal form. 260/10809 useless extension candidates. Maximal degree in co-relation 34190. Up to 1877 conditions per place. [2022-01-18 22:40:43,906 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 67 selfloop transitions, 28 changer transitions 66/256 dead transitions. [2022-01-18 22:40:43,906 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 256 transitions, 2019 flow [2022-01-18 22:40:43,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 22:40:43,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-18 22:40:43,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1315 transitions. [2022-01-18 22:40:43,909 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8720159151193634 [2022-01-18 22:40:43,909 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1315 transitions. [2022-01-18 22:40:43,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1315 transitions. [2022-01-18 22:40:43,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:40:43,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1315 transitions. [2022-01-18 22:40:43,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 101.15384615384616) internal successors, (1315), 13 states have internal predecessors, (1315), 0 states have call successors, (0), 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-01-18 22:40:43,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 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-01-18 22:40:43,913 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 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-01-18 22:40:43,914 INFO L186 Difference]: Start difference. First operand has 170 places, 148 transitions, 953 flow. Second operand 13 states and 1315 transitions. [2022-01-18 22:40:43,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 256 transitions, 2019 flow [2022-01-18 22:40:44,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 256 transitions, 1987 flow, removed 16 selfloop flow, removed 0 redundant places. [2022-01-18 22:40:44,012 INFO L242 Difference]: Finished difference. Result has 188 places, 146 transitions, 943 flow [2022-01-18 22:40:44,012 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=943, PETRI_PLACES=188, PETRI_TRANSITIONS=146} [2022-01-18 22:40:44,014 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 67 predicate places. [2022-01-18 22:40:44,014 INFO L470 AbstractCegarLoop]: Abstraction has has 188 places, 146 transitions, 943 flow [2022-01-18 22:40:44,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 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-01-18 22:40:44,014 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:44,014 INFO L254 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] [2022-01-18 22:40:44,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 22:40:44,015 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:44,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:44,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2034966272, now seen corresponding path program 1 times [2022-01-18 22:40:44,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:44,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392597654] [2022-01-18 22:40:44,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:44,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:40:44,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:40:44,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:40:44,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392597654] [2022-01-18 22:40:44,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392597654] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:40:44,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:40:44,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-18 22:40:44,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851453443] [2022-01-18 22:40:44,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:40:44,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-18 22:40:44,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:40:44,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-18 22:40:44,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-18 22:40:44,144 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 116 [2022-01-18 22:40:44,144 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 146 transitions, 943 flow. Second operand has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 0 states have call successors, (0), 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-01-18 22:40:44,144 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:40:44,144 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 116 [2022-01-18 22:40:44,144 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:40:45,508 INFO L129 PetriNetUnfolder]: 4385/9743 cut-off events. [2022-01-18 22:40:45,508 INFO L130 PetriNetUnfolder]: For 30537/33524 co-relation queries the response was YES. [2022-01-18 22:40:45,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33978 conditions, 9743 events. 4385/9743 cut-off events. For 30537/33524 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 98098 event pairs, 321 based on Foata normal form. 142/9593 useless extension candidates. Maximal degree in co-relation 33927. Up to 1442 conditions per place. [2022-01-18 22:40:45,560 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 28 selfloop transitions, 14 changer transitions 90/223 dead transitions. [2022-01-18 22:40:45,560 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 223 transitions, 1705 flow [2022-01-18 22:40:45,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-18 22:40:45,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-18 22:40:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1576 transitions. [2022-01-18 22:40:45,563 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8491379310344828 [2022-01-18 22:40:45,563 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1576 transitions. [2022-01-18 22:40:45,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1576 transitions. [2022-01-18 22:40:45,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:40:45,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1576 transitions. [2022-01-18 22:40:45,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 98.5) internal successors, (1576), 16 states have internal predecessors, (1576), 0 states have call successors, (0), 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-01-18 22:40:45,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 116.0) internal successors, (1972), 17 states have internal predecessors, (1972), 0 states have call successors, (0), 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-01-18 22:40:45,569 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 116.0) internal successors, (1972), 17 states have internal predecessors, (1972), 0 states have call successors, (0), 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-01-18 22:40:45,569 INFO L186 Difference]: Start difference. First operand has 188 places, 146 transitions, 943 flow. Second operand 16 states and 1576 transitions. [2022-01-18 22:40:45,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 223 transitions, 1705 flow [2022-01-18 22:40:46,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 223 transitions, 1505 flow, removed 77 selfloop flow, removed 21 redundant places. [2022-01-18 22:40:46,053 INFO L242 Difference]: Finished difference. Result has 176 places, 121 transitions, 646 flow [2022-01-18 22:40:46,053 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=646, PETRI_PLACES=176, PETRI_TRANSITIONS=121} [2022-01-18 22:40:46,053 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 55 predicate places. [2022-01-18 22:40:46,054 INFO L470 AbstractCegarLoop]: Abstraction has has 176 places, 121 transitions, 646 flow [2022-01-18 22:40:46,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 0 states have call successors, (0), 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-01-18 22:40:46,054 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:46,054 INFO L254 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] [2022-01-18 22:40:46,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 22:40:46,054 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:46,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:46,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1507932727, now seen corresponding path program 1 times [2022-01-18 22:40:46,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:46,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36661880] [2022-01-18 22:40:46,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:46,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:40:46,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:40:46,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:40:46,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36661880] [2022-01-18 22:40:46,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36661880] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:40:46,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:40:46,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-18 22:40:46,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187755441] [2022-01-18 22:40:46,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:40:46,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-18 22:40:46,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:40:46,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-18 22:40:46,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-18 22:40:46,224 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 116 [2022-01-18 22:40:46,225 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 121 transitions, 646 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-01-18 22:40:46,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:40:46,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 116 [2022-01-18 22:40:46,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:40:46,540 INFO L129 PetriNetUnfolder]: 363/2750 cut-off events. [2022-01-18 22:40:46,540 INFO L130 PetriNetUnfolder]: For 7001/7274 co-relation queries the response was YES. [2022-01-18 22:40:46,551 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8014 conditions, 2750 events. 363/2750 cut-off events. For 7001/7274 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 33651 event pairs, 23 based on Foata normal form. 4/2568 useless extension candidates. Maximal degree in co-relation 7907. Up to 528 conditions per place. [2022-01-18 22:40:46,553 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 23 selfloop transitions, 5 changer transitions 22/142 dead transitions. [2022-01-18 22:40:46,553 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 142 transitions, 800 flow [2022-01-18 22:40:46,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:40:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:40:46,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 861 transitions. [2022-01-18 22:40:46,554 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8247126436781609 [2022-01-18 22:40:46,554 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 861 transitions. [2022-01-18 22:40:46,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 861 transitions. [2022-01-18 22:40:46,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:40:46,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 861 transitions. [2022-01-18 22:40:46,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.66666666666667) internal successors, (861), 9 states have internal predecessors, (861), 0 states have call successors, (0), 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-01-18 22:40:46,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 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-01-18 22:40:46,557 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 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-01-18 22:40:46,558 INFO L186 Difference]: Start difference. First operand has 176 places, 121 transitions, 646 flow. Second operand 9 states and 861 transitions. [2022-01-18 22:40:46,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 142 transitions, 800 flow [2022-01-18 22:40:46,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 142 transitions, 659 flow, removed 39 selfloop flow, removed 24 redundant places. [2022-01-18 22:40:46,611 INFO L242 Difference]: Finished difference. Result has 153 places, 116 transitions, 467 flow [2022-01-18 22:40:46,611 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=467, PETRI_PLACES=153, PETRI_TRANSITIONS=116} [2022-01-18 22:40:46,612 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 32 predicate places. [2022-01-18 22:40:46,612 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 116 transitions, 467 flow [2022-01-18 22:40:46,612 INFO L471 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-01-18 22:40:46,612 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:46,612 INFO L254 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] [2022-01-18 22:40:46,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-18 22:40:46,612 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:46,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:46,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1645554239, now seen corresponding path program 2 times [2022-01-18 22:40:46,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:46,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476476407] [2022-01-18 22:40:46,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:46,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:40:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:40:46,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:40:46,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476476407] [2022-01-18 22:40:46,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476476407] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:40:46,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:40:46,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-18 22:40:46,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081770643] [2022-01-18 22:40:46,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:40:46,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-18 22:40:46,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:40:46,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-18 22:40:46,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-18 22:40:46,757 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116 [2022-01-18 22:40:46,758 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 116 transitions, 467 flow. Second operand has 11 states, 11 states have (on average 89.18181818181819) internal successors, (981), 11 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:40:46,758 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:40:46,758 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116 [2022-01-18 22:40:46,758 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:40:46,997 INFO L129 PetriNetUnfolder]: 163/1384 cut-off events. [2022-01-18 22:40:46,997 INFO L130 PetriNetUnfolder]: For 1081/1145 co-relation queries the response was YES. [2022-01-18 22:40:47,002 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3012 conditions, 1384 events. 163/1384 cut-off events. For 1081/1145 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 14350 event pairs, 8 based on Foata normal form. 15/1312 useless extension candidates. Maximal degree in co-relation 2982. Up to 170 conditions per place. [2022-01-18 22:40:47,003 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 25 selfloop transitions, 5 changer transitions 18/132 dead transitions. [2022-01-18 22:40:47,003 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 132 transitions, 643 flow [2022-01-18 22:40:47,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 22:40:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-18 22:40:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 998 transitions. [2022-01-18 22:40:47,005 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7821316614420063 [2022-01-18 22:40:47,005 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 998 transitions. [2022-01-18 22:40:47,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 998 transitions. [2022-01-18 22:40:47,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:40:47,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 998 transitions. [2022-01-18 22:40:47,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 90.72727272727273) internal successors, (998), 11 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:40:47,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 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-01-18 22:40:47,008 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 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-01-18 22:40:47,008 INFO L186 Difference]: Start difference. First operand has 153 places, 116 transitions, 467 flow. Second operand 11 states and 998 transitions. [2022-01-18 22:40:47,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 132 transitions, 643 flow [2022-01-18 22:40:47,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 132 transitions, 559 flow, removed 20 selfloop flow, removed 12 redundant places. [2022-01-18 22:40:47,013 INFO L242 Difference]: Finished difference. Result has 151 places, 110 transitions, 386 flow [2022-01-18 22:40:47,013 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=386, PETRI_PLACES=151, PETRI_TRANSITIONS=110} [2022-01-18 22:40:47,014 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 30 predicate places. [2022-01-18 22:40:47,014 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 110 transitions, 386 flow [2022-01-18 22:40:47,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.18181818181819) internal successors, (981), 11 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:40:47,014 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:47,014 INFO L254 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] [2022-01-18 22:40:47,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-18 22:40:47,015 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:47,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:47,015 INFO L85 PathProgramCache]: Analyzing trace with hash 98370013, now seen corresponding path program 3 times [2022-01-18 22:40:47,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:47,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929865804] [2022-01-18 22:40:47,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:47,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:40:47,047 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-18 22:40:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:40:47,102 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-18 22:40:47,102 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-18 22:40:47,103 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-18 22:40:47,104 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-18 22:40:47,104 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-18 22:40:47,104 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-18 22:40:47,104 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-18 22:40:47,104 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-18 22:40:47,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-18 22:40:47,107 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:40:47,110 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 22:40:47,110 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 22:40:47,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 10:40:47 BasicIcfg [2022-01-18 22:40:47,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 22:40:47,226 INFO L158 Benchmark]: Toolchain (without parser) took 12154.46ms. Allocated memory was 442.5MB in the beginning and 2.7GB in the end (delta: 2.2GB). Free memory was 385.6MB in the beginning and 2.0GB in the end (delta: -1.6GB). Peak memory consumption was 646.6MB. Max. memory is 16.0GB. [2022-01-18 22:40:47,226 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 442.5MB. Free memory is still 403.3MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 22:40:47,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.37ms. Allocated memory was 442.5MB in the beginning and 557.8MB in the end (delta: 115.3MB). Free memory was 385.3MB in the beginning and 517.0MB in the end (delta: -131.7MB). Peak memory consumption was 7.0MB. Max. memory is 16.0GB. [2022-01-18 22:40:47,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.33ms. Allocated memory is still 557.8MB. Free memory was 517.0MB in the beginning and 513.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 22:40:47,227 INFO L158 Benchmark]: Boogie Preprocessor took 28.31ms. Allocated memory is still 557.8MB. Free memory was 513.9MB in the beginning and 511.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 22:40:47,227 INFO L158 Benchmark]: RCFGBuilder took 781.61ms. Allocated memory is still 557.8MB. Free memory was 511.8MB in the beginning and 428.9MB in the end (delta: 82.8MB). Peak memory consumption was 83.9MB. Max. memory is 16.0GB. [2022-01-18 22:40:47,227 INFO L158 Benchmark]: TraceAbstraction took 10928.60ms. Allocated memory was 557.8MB in the beginning and 2.7GB in the end (delta: 2.1GB). Free memory was 427.9MB in the beginning and 2.0GB in the end (delta: -1.5GB). Peak memory consumption was 575.4MB. Max. memory is 16.0GB. [2022-01-18 22:40:47,229 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.13ms. Allocated memory is still 442.5MB. Free memory is still 403.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 362.37ms. Allocated memory was 442.5MB in the beginning and 557.8MB in the end (delta: 115.3MB). Free memory was 385.3MB in the beginning and 517.0MB in the end (delta: -131.7MB). Peak memory consumption was 7.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 49.33ms. Allocated memory is still 557.8MB. Free memory was 517.0MB in the beginning and 513.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 28.31ms. Allocated memory is still 557.8MB. Free memory was 513.9MB in the beginning and 511.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 781.61ms. Allocated memory is still 557.8MB. Free memory was 511.8MB in the beginning and 428.9MB in the end (delta: 82.8MB). Peak memory consumption was 83.9MB. Max. memory is 16.0GB. * TraceAbstraction took 10928.60ms. Allocated memory was 557.8MB in the beginning and 2.7GB in the end (delta: 2.1GB). Free memory was 427.9MB in the beginning and 2.0GB in the end (delta: -1.5GB). Peak memory consumption was 575.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L721] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L722] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L723] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L724] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L725] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L726] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L727] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L728] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L729] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L730] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L731] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L732] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L733] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L734] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L735] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L736] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L737] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t745; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t745={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t745, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t745, ((void *)0), P0, ((void *)0))=-2, t745={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t746; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t745={5:0}, t746={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t746, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t746, ((void *)0), P1, ((void *)0))=-1, t745={5:0}, t746={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t747; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t745={5:0}, t746={6:0}, t747={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t747, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t747, ((void *)0), P2, ((void *)0))=0, t745={5:0}, t746={6:0}, t747={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z [L802] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L802] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L803] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L803] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L804] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L805] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L805] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L807] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L808] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = z [L810] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t745={5:0}, t746={6:0}, t747={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t745={5:0}, t746={6:0}, t747={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 837]: 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: 839]: 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, 144 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: 10.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 736 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 736 mSDsluCounter, 733 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1287 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1606 IncrementalHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 173 mSDtfsCounter, 1606 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=953occurred in iteration=7, InterpolantAutomatonStates: 117, 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.9s InterpolantComputationTime, 952 NumberOfCodeBlocks, 952 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 851 ConstructedInterpolants, 0 QuantifiedInterpolants, 4425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-01-18 22:40:47,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...