/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-12 21:05:50,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-12 21:05:50,312 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-12 21:05:50,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-12 21:05:50,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-12 21:05:50,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-12 21:05:50,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-12 21:05:50,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-12 21:05:50,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-12 21:05:50,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-12 21:05:50,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-12 21:05:50,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-12 21:05:50,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-12 21:05:50,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-12 21:05:50,373 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-12 21:05:50,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-12 21:05:50,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-12 21:05:50,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-12 21:05:50,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-12 21:05:50,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-12 21:05:50,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-12 21:05:50,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-12 21:05:50,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-12 21:05:50,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-12 21:05:50,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-12 21:05:50,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-12 21:05:50,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-12 21:05:50,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-12 21:05:50,387 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-12 21:05:50,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-12 21:05:50,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-12 21:05:50,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-12 21:05:50,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-12 21:05:50,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-12 21:05:50,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-12 21:05:50,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-12 21:05:50,390 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-12 21:05:50,390 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-12 21:05:50,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-12 21:05:50,391 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-12 21:05:50,391 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-12 21:05:50,395 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 [2021-08-12 21:05:50,423 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-12 21:05:50,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-12 21:05:50,426 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-12 21:05:50,426 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-12 21:05:50,426 INFO L138 SettingsManager]: * Use SBE=true [2021-08-12 21:05:50,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-12 21:05:50,427 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-12 21:05:50,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-12 21:05:50,427 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-12 21:05:50,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-12 21:05:50,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-12 21:05:50,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-12 21:05:50,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-12 21:05:50,428 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-12 21:05:50,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-12 21:05:50,428 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-12 21:05:50,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-12 21:05:50,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-12 21:05:50,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-12 21:05:50,428 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-12 21:05:50,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-12 21:05:50,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 21:05:50,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-12 21:05:50,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-12 21:05:50,429 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-12 21:05:50,429 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-12 21:05:50,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-12 21:05:50,429 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-12 21:05:50,429 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-12 21:05:50,429 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-12 21:05:50,429 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 [2021-08-12 21:05:50,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-12 21:05:50,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-12 21:05:50,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-12 21:05:50,707 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-12 21:05:50,707 INFO L275 PluginConnector]: CDTParser initialized [2021-08-12 21:05:50,708 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i [2021-08-12 21:05:50,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6166146b/b1aa2255a5a647d6b2dfbb2b7ac62c57/FLAGbbe3b299b [2021-08-12 21:05:51,150 INFO L306 CDTParser]: Found 1 translation units. [2021-08-12 21:05:51,150 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i [2021-08-12 21:05:51,163 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6166146b/b1aa2255a5a647d6b2dfbb2b7ac62c57/FLAGbbe3b299b [2021-08-12 21:05:51,492 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6166146b/b1aa2255a5a647d6b2dfbb2b7ac62c57 [2021-08-12 21:05:51,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-12 21:05:51,499 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-12 21:05:51,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-12 21:05:51,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-12 21:05:51,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-12 21:05:51,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 09:05:51" (1/1) ... [2021-08-12 21:05:51,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1ae8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:51, skipping insertion in model container [2021-08-12 21:05:51,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 09:05:51" (1/1) ... [2021-08-12 21:05:51,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-12 21:05:51,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-12 21:05:51,711 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i[951,964] [2021-08-12 21:05:51,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 21:05:51,922 INFO L203 MainTranslator]: Completed pre-run [2021-08-12 21:05:51,934 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i[951,964] [2021-08-12 21:05:51,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 21:05:52,044 INFO L208 MainTranslator]: Completed translation [2021-08-12 21:05:52,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:52 WrapperNode [2021-08-12 21:05:52,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-12 21:05:52,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-12 21:05:52,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-12 21:05:52,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-12 21:05:52,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:52" (1/1) ... [2021-08-12 21:05:52,082 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:52" (1/1) ... [2021-08-12 21:05:52,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-12 21:05:52,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-12 21:05:52,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-12 21:05:52,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-12 21:05:52,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:52" (1/1) ... [2021-08-12 21:05:52,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:52" (1/1) ... [2021-08-12 21:05:52,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:52" (1/1) ... [2021-08-12 21:05:52,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:52" (1/1) ... [2021-08-12 21:05:52,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:52" (1/1) ... [2021-08-12 21:05:52,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:52" (1/1) ... [2021-08-12 21:05:52,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:52" (1/1) ... [2021-08-12 21:05:52,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-12 21:05:52,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-12 21:05:52,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-12 21:05:52,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-12 21:05:52,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 21:05:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-12 21:05:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-12 21:05:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-12 21:05:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-12 21:05:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-12 21:05:52,212 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-12 21:05:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-12 21:05:52,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-12 21:05:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-12 21:05:52,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-12 21:05:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-12 21:05:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-12 21:05:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-12 21:05:52,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-12 21:05:52,214 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-12 21:05:53,430 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-12 21:05:53,430 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-12 21:05:53,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 09:05:53 BoogieIcfgContainer [2021-08-12 21:05:53,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-12 21:05:53,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-12 21:05:53,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-12 21:05:53,434 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-12 21:05:53,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.08 09:05:51" (1/3) ... [2021-08-12 21:05:53,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564963a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 09:05:53, skipping insertion in model container [2021-08-12 21:05:53,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:52" (2/3) ... [2021-08-12 21:05:53,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564963a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 09:05:53, skipping insertion in model container [2021-08-12 21:05:53,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 09:05:53" (3/3) ... [2021-08-12 21:05:53,436 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_power.opt.i [2021-08-12 21:05:53,441 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-12 21:05:53,441 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-12 21:05:53,442 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-12 21:05:53,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,463 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,463 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,463 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,463 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,466 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,466 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,466 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,466 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,466 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,466 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,467 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,467 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,469 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,469 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,469 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,470 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,474 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,474 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,475 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,475 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,475 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,477 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,477 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:53,478 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-12 21:05:53,493 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-12 21:05:53,506 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-12 21:05:53,506 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-12 21:05:53,506 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-12 21:05:53,506 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-12 21:05:53,506 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-12 21:05:53,506 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-12 21:05:53,506 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-12 21:05:53,506 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-12 21:05:53,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2021-08-12 21:05:53,536 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2021-08-12 21:05:53,536 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 21:05:53,539 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-08-12 21:05:53,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2021-08-12 21:05:53,542 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2021-08-12 21:05:53,549 INFO L129 PetriNetUnfolder]: 0/55 cut-off events. [2021-08-12 21:05:53,549 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 21:05:53,549 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:53,549 INFO L266 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] [2021-08-12 21:05:53,550 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:53,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:53,553 INFO L82 PathProgramCache]: Analyzing trace with hash -107778548, now seen corresponding path program 1 times [2021-08-12 21:05:53,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:53,558 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113326277] [2021-08-12 21:05:53,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:53,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:53,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:53,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:53,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:53,741 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:53,742 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113326277] [2021-08-12 21:05:53,742 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113326277] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:53,742 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:53,742 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-12 21:05:53,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193611037] [2021-08-12 21:05:53,748 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 21:05:53,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:53,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 21:05:53,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 21:05:53,757 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 106 [2021-08-12 21:05:53,759 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:53,759 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:53,759 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 106 [2021-08-12 21:05:53,760 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:05:53,830 INFO L129 PetriNetUnfolder]: 49/388 cut-off events. [2021-08-12 21:05:53,830 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 21:05:53,832 INFO L84 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 388 events. 49/388 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1946 event pairs, 27 based on Foata normal form. 18/382 useless extension candidates. Maximal degree in co-relation 437. Up to 65 conditions per place. [2021-08-12 21:05:53,834 INFO L132 encePairwiseOnDemand]: 101/106 looper letters, 9 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2021-08-12 21:05:53,834 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 103 transitions, 237 flow [2021-08-12 21:05:53,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 21:05:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-12 21:05:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2021-08-12 21:05:53,842 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9465408805031447 [2021-08-12 21:05:53,843 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2021-08-12 21:05:53,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2021-08-12 21:05:53,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:05:53,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2021-08-12 21:05:53,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:53,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:53,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:53,851 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2021-08-12 21:05:53,851 INFO L482 AbstractCegarLoop]: Abstraction has has 111 places, 103 transitions, 237 flow [2021-08-12 21:05:53,851 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:53,851 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:53,852 INFO L266 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] [2021-08-12 21:05:53,852 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-12 21:05:53,852 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:53,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:53,852 INFO L82 PathProgramCache]: Analyzing trace with hash -81503802, now seen corresponding path program 1 times [2021-08-12 21:05:53,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:53,853 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83981795] [2021-08-12 21:05:53,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:53,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:53,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:53,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:53,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:53,952 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 21:05:53,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 21:05:53,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:53,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:53,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:53,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:53,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:53,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:53,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:53,978 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:53,978 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83981795] [2021-08-12 21:05:53,978 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83981795] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:53,978 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:53,978 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 21:05:53,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381307391] [2021-08-12 21:05:53,979 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 21:05:53,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:53,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 21:05:53,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 21:05:53,981 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 106 [2021-08-12 21:05:53,982 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:53,982 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:53,982 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 106 [2021-08-12 21:05:53,982 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:05:54,164 INFO L129 PetriNetUnfolder]: 199/958 cut-off events. [2021-08-12 21:05:54,164 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-08-12 21:05:54,167 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 958 events. 199/958 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7381 event pairs, 90 based on Foata normal form. 0/910 useless extension candidates. Maximal degree in co-relation 1385. Up to 204 conditions per place. [2021-08-12 21:05:54,169 INFO L132 encePairwiseOnDemand]: 99/106 looper letters, 10 selfloop transitions, 3 changer transitions 22/127 dead transitions. [2021-08-12 21:05:54,169 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 127 transitions, 359 flow [2021-08-12 21:05:54,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 21:05:54,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-12 21:05:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 872 transitions. [2021-08-12 21:05:54,173 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9140461215932913 [2021-08-12 21:05:54,174 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 872 transitions. [2021-08-12 21:05:54,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 872 transitions. [2021-08-12 21:05:54,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:05:54,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 872 transitions. [2021-08-12 21:05:54,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.88888888888889) internal successors, (872), 9 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:54,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:54,179 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:54,180 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 8 predicate places. [2021-08-12 21:05:54,180 INFO L482 AbstractCegarLoop]: Abstraction has has 119 places, 127 transitions, 359 flow [2021-08-12 21:05:54,180 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:54,180 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:54,180 INFO L266 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] [2021-08-12 21:05:54,180 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-12 21:05:54,181 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:54,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:54,181 INFO L82 PathProgramCache]: Analyzing trace with hash 208493127, now seen corresponding path program 1 times [2021-08-12 21:05:54,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:54,181 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661833190] [2021-08-12 21:05:54,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:54,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:54,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:54,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:54,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:54,266 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 21:05:54,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 21:05:54,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:54,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:54,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:54,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:54,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:54,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:54,291 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:54,291 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661833190] [2021-08-12 21:05:54,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661833190] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:54,292 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:54,292 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 21:05:54,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407836319] [2021-08-12 21:05:54,292 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 21:05:54,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:54,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 21:05:54,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 21:05:54,294 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 106 [2021-08-12 21:05:54,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 127 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:54,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:54,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 106 [2021-08-12 21:05:54,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:05:54,547 INFO L129 PetriNetUnfolder]: 387/1842 cut-off events. [2021-08-12 21:05:54,547 INFO L130 PetriNetUnfolder]: For 160/169 co-relation queries the response was YES. [2021-08-12 21:05:54,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3081 conditions, 1842 events. 387/1842 cut-off events. For 160/169 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17293 event pairs, 135 based on Foata normal form. 0/1792 useless extension candidates. Maximal degree in co-relation 3028. Up to 312 conditions per place. [2021-08-12 21:05:54,557 INFO L132 encePairwiseOnDemand]: 100/106 looper letters, 8 selfloop transitions, 2 changer transitions 53/158 dead transitions. [2021-08-12 21:05:54,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 158 transitions, 587 flow [2021-08-12 21:05:54,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 21:05:54,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-12 21:05:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 869 transitions. [2021-08-12 21:05:54,560 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.910901467505241 [2021-08-12 21:05:54,560 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 869 transitions. [2021-08-12 21:05:54,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 869 transitions. [2021-08-12 21:05:54,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:05:54,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 869 transitions. [2021-08-12 21:05:54,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.55555555555556) internal successors, (869), 9 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:54,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:54,564 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:54,564 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 16 predicate places. [2021-08-12 21:05:54,564 INFO L482 AbstractCegarLoop]: Abstraction has has 127 places, 158 transitions, 587 flow [2021-08-12 21:05:54,564 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:54,565 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:54,565 INFO L266 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] [2021-08-12 21:05:54,565 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-12 21:05:54,565 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:54,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:54,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1080785100, now seen corresponding path program 1 times [2021-08-12 21:05:54,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:54,566 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297132266] [2021-08-12 21:05:54,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:54,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:54,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:54,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:54,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:54,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:54,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 21:05:54,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:54,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 21:05:54,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:54,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-12 21:05:54,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:54,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-12 21:05:54,718 INFO L142 QuantifierPusher]: treesize reduction 36, result has 65.4 percent of original size [2021-08-12 21:05:54,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-08-12 21:05:54,745 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 21:05:54,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 21:05:54,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:54,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:54,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:54,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:54,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:54,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:54,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:54,782 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:54,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297132266] [2021-08-12 21:05:54,782 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297132266] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:54,782 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:54,782 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-12 21:05:54,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166372485] [2021-08-12 21:05:54,783 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-12 21:05:54,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:54,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-12 21:05:54,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-08-12 21:05:54,785 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2021-08-12 21:05:54,787 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 158 transitions, 587 flow. Second operand has 11 states, 11 states have (on average 85.0909090909091) internal successors, (936), 11 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:54,787 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:54,787 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2021-08-12 21:05:54,787 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:05:55,893 INFO L129 PetriNetUnfolder]: 2131/5968 cut-off events. [2021-08-12 21:05:55,894 INFO L130 PetriNetUnfolder]: For 2116/2395 co-relation queries the response was YES. [2021-08-12 21:05:55,908 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12900 conditions, 5968 events. 2131/5968 cut-off events. For 2116/2395 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 59833 event pairs, 427 based on Foata normal form. 7/5875 useless extension candidates. Maximal degree in co-relation 12840. Up to 1222 conditions per place. [2021-08-12 21:05:55,915 INFO L132 encePairwiseOnDemand]: 93/106 looper letters, 19 selfloop transitions, 10 changer transitions 216/319 dead transitions. [2021-08-12 21:05:55,915 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 319 transitions, 1891 flow [2021-08-12 21:05:55,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-12 21:05:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-08-12 21:05:55,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1504 transitions. [2021-08-12 21:05:55,919 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8346281908990011 [2021-08-12 21:05:55,920 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1504 transitions. [2021-08-12 21:05:55,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1504 transitions. [2021-08-12 21:05:55,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:05:55,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1504 transitions. [2021-08-12 21:05:55,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 88.47058823529412) internal successors, (1504), 17 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:55,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 106.0) internal successors, (1908), 18 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:55,929 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 106.0) internal successors, (1908), 18 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:55,930 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 32 predicate places. [2021-08-12 21:05:55,930 INFO L482 AbstractCegarLoop]: Abstraction has has 143 places, 319 transitions, 1891 flow [2021-08-12 21:05:55,931 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 85.0909090909091) internal successors, (936), 11 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:55,931 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:55,931 INFO L266 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] [2021-08-12 21:05:55,931 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-12 21:05:55,931 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:55,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:55,932 INFO L82 PathProgramCache]: Analyzing trace with hash -715422780, now seen corresponding path program 1 times [2021-08-12 21:05:55,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:55,932 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498993313] [2021-08-12 21:05:55,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:56,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:56,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:56,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:56,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:56,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:56,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 21:05:56,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:56,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 21:05:56,060 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 21:05:56,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 21:05:56,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:56,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:56,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:56,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:56,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:56,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:56,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:56,090 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:56,090 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498993313] [2021-08-12 21:05:56,090 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498993313] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:56,090 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:56,090 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 21:05:56,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274468910] [2021-08-12 21:05:56,091 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 21:05:56,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:56,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 21:05:56,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-12 21:05:56,092 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 106 [2021-08-12 21:05:56,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 319 transitions, 1891 flow. Second operand has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:56,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:56,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 106 [2021-08-12 21:05:56,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:05:57,039 INFO L129 PetriNetUnfolder]: 2483/7033 cut-off events. [2021-08-12 21:05:57,039 INFO L130 PetriNetUnfolder]: For 3159/4117 co-relation queries the response was YES. [2021-08-12 21:05:57,059 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18490 conditions, 7033 events. 2483/7033 cut-off events. For 3159/4117 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 73304 event pairs, 400 based on Foata normal form. 34/6961 useless extension candidates. Maximal degree in co-relation 18425. Up to 2210 conditions per place. [2021-08-12 21:05:57,069 INFO L132 encePairwiseOnDemand]: 95/106 looper letters, 26 selfloop transitions, 9 changer transitions 326/437 dead transitions. [2021-08-12 21:05:57,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 437 transitions, 3451 flow [2021-08-12 21:05:57,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-12 21:05:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-08-12 21:05:57,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1009 transitions. [2021-08-12 21:05:57,071 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8653516295025729 [2021-08-12 21:05:57,071 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1009 transitions. [2021-08-12 21:05:57,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1009 transitions. [2021-08-12 21:05:57,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:05:57,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1009 transitions. [2021-08-12 21:05:57,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 91.72727272727273) internal successors, (1009), 11 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) [2021-08-12 21:05:57,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 106.0) internal successors, (1272), 12 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:57,075 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 106.0) internal successors, (1272), 12 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:57,075 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 42 predicate places. [2021-08-12 21:05:57,075 INFO L482 AbstractCegarLoop]: Abstraction has has 153 places, 437 transitions, 3451 flow [2021-08-12 21:05:57,076 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:57,076 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:57,076 INFO L266 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] [2021-08-12 21:05:57,076 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-12 21:05:57,076 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:57,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:57,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1107616350, now seen corresponding path program 2 times [2021-08-12 21:05:57,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:57,076 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035501208] [2021-08-12 21:05:57,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:57,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:57,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:57,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:57,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:57,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:57,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:57,162 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 21:05:57,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 21:05:57,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:57,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:57,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:57,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:57,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:57,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:57,191 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:57,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035501208] [2021-08-12 21:05:57,191 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035501208] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:57,192 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:57,192 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 21:05:57,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058940175] [2021-08-12 21:05:57,193 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 21:05:57,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:57,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 21:05:57,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-12 21:05:57,194 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-08-12 21:05:57,195 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 437 transitions, 3451 flow. Second operand has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:57,195 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:57,195 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-08-12 21:05:57,196 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:05:58,617 INFO L129 PetriNetUnfolder]: 4404/12321 cut-off events. [2021-08-12 21:05:58,617 INFO L130 PetriNetUnfolder]: For 7724/8566 co-relation queries the response was YES. [2021-08-12 21:05:58,668 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34384 conditions, 12321 events. 4404/12321 cut-off events. For 7724/8566 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 137776 event pairs, 705 based on Foata normal form. 23/12183 useless extension candidates. Maximal degree in co-relation 34315. Up to 4189 conditions per place. [2021-08-12 21:05:58,680 INFO L132 encePairwiseOnDemand]: 98/106 looper letters, 7 selfloop transitions, 4 changer transitions 500/605 dead transitions. [2021-08-12 21:05:58,680 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 605 transitions, 5947 flow [2021-08-12 21:05:58,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 21:05:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-12 21:05:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1233 transitions. [2021-08-12 21:05:58,683 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8947750362844702 [2021-08-12 21:05:58,683 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1233 transitions. [2021-08-12 21:05:58,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1233 transitions. [2021-08-12 21:05:58,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:05:58,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1233 transitions. [2021-08-12 21:05:58,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 94.84615384615384) internal successors, (1233), 13 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:58,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:58,687 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:58,687 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 54 predicate places. [2021-08-12 21:05:58,688 INFO L482 AbstractCegarLoop]: Abstraction has has 165 places, 605 transitions, 5947 flow [2021-08-12 21:05:58,688 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:58,688 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:58,688 INFO L266 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] [2021-08-12 21:05:58,688 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-12 21:05:58,688 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:58,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:58,689 INFO L82 PathProgramCache]: Analyzing trace with hash -453670005, now seen corresponding path program 1 times [2021-08-12 21:05:58,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:58,689 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907086090] [2021-08-12 21:05:58,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:58,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:58,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:58,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:58,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:58,737 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 21:05:58,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 21:05:58,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:58,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:58,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:58,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:58,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:58,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:58,763 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:58,763 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907086090] [2021-08-12 21:05:58,763 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907086090] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:58,763 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:58,763 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 21:05:58,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728657498] [2021-08-12 21:05:58,764 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 21:05:58,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:58,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 21:05:58,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 21:05:58,765 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 106 [2021-08-12 21:05:58,766 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 605 transitions, 5947 flow. Second operand has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:05:58,766 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:58,766 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 106 [2021-08-12 21:05:58,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:06:01,158 INFO L129 PetriNetUnfolder]: 6574/18989 cut-off events. [2021-08-12 21:06:01,158 INFO L130 PetriNetUnfolder]: For 19624/21222 co-relation queries the response was YES. [2021-08-12 21:06:01,210 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58973 conditions, 18989 events. 6574/18989 cut-off events. For 19624/21222 co-relation queries the response was YES. Maximal size of possible extension queue 1180. Compared 232789 event pairs, 620 based on Foata normal form. 34/18871 useless extension candidates. Maximal degree in co-relation 58901. Up to 7104 conditions per place. [2021-08-12 21:06:01,225 INFO L132 encePairwiseOnDemand]: 100/106 looper letters, 12 selfloop transitions, 3 changer transitions 838/946 dead transitions. [2021-08-12 21:06:01,225 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 946 transitions, 11565 flow [2021-08-12 21:06:01,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 21:06:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-12 21:06:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 867 transitions. [2021-08-12 21:06:01,227 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9088050314465409 [2021-08-12 21:06:01,227 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 867 transitions. [2021-08-12 21:06:01,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 867 transitions. [2021-08-12 21:06:01,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:06:01,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 867 transitions. [2021-08-12 21:06:01,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.33333333333333) internal successors, (867), 9 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:01,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:01,230 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:01,230 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 62 predicate places. [2021-08-12 21:06:01,230 INFO L482 AbstractCegarLoop]: Abstraction has has 173 places, 946 transitions, 11565 flow [2021-08-12 21:06:01,231 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:01,231 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:06:01,231 INFO L266 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] [2021-08-12 21:06:01,231 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-12 21:06:01,231 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:06:01,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:06:01,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1430672608, now seen corresponding path program 1 times [2021-08-12 21:06:01,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:06:01,231 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771343250] [2021-08-12 21:06:01,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:06:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:06:01,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:01,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:06:01,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:01,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:06:01,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:01,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 21:06:01,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:01,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 21:06:01,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:01,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-12 21:06:01,310 INFO L142 QuantifierPusher]: treesize reduction 21, result has 75.0 percent of original size [2021-08-12 21:06:01,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2021-08-12 21:06:01,340 INFO L142 QuantifierPusher]: treesize reduction 47, result has 64.1 percent of original size [2021-08-12 21:06:01,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 84 [2021-08-12 21:06:01,366 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 21:06:01,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 21:06:01,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:01,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:06:01,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:01,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:06:01,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:01,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:06:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:06:01,391 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:06:01,391 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771343250] [2021-08-12 21:06:01,391 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771343250] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:06:01,391 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:06:01,391 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-12 21:06:01,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353384011] [2021-08-12 21:06:01,392 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-12 21:06:01,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:06:01,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-12 21:06:01,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-08-12 21:06:01,393 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 106 [2021-08-12 21:06:01,393 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 946 transitions, 11565 flow. Second operand has 11 states, 11 states have (on average 86.18181818181819) internal successors, (948), 11 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:01,394 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:06:01,394 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 106 [2021-08-12 21:06:01,394 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:06:05,079 INFO L129 PetriNetUnfolder]: 8598/24887 cut-off events. [2021-08-12 21:06:05,079 INFO L130 PetriNetUnfolder]: For 31321/35291 co-relation queries the response was YES. [2021-08-12 21:06:05,152 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88743 conditions, 24887 events. 8598/24887 cut-off events. For 31321/35291 co-relation queries the response was YES. Maximal size of possible extension queue 1515. Compared 318591 event pairs, 516 based on Foata normal form. 106/24839 useless extension candidates. Maximal degree in co-relation 88665. Up to 9458 conditions per place. [2021-08-12 21:06:05,172 INFO L132 encePairwiseOnDemand]: 94/106 looper letters, 26 selfloop transitions, 9 changer transitions 1196/1307 dead transitions. [2021-08-12 21:06:05,172 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 1307 transitions, 18737 flow [2021-08-12 21:06:05,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-12 21:06:05,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-12 21:06:05,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1444 transitions. [2021-08-12 21:06:05,175 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8514150943396226 [2021-08-12 21:06:05,175 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1444 transitions. [2021-08-12 21:06:05,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1444 transitions. [2021-08-12 21:06:05,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:06:05,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1444 transitions. [2021-08-12 21:06:05,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 90.25) internal successors, (1444), 16 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:05,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 106.0) internal successors, (1802), 17 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:05,179 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 106.0) internal successors, (1802), 17 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:05,180 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 77 predicate places. [2021-08-12 21:06:05,180 INFO L482 AbstractCegarLoop]: Abstraction has has 188 places, 1307 transitions, 18737 flow [2021-08-12 21:06:05,180 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 86.18181818181819) internal successors, (948), 11 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:05,180 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:06:05,180 INFO L266 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] [2021-08-12 21:06:05,180 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-12 21:06:05,180 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:06:05,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:06:05,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1091205088, now seen corresponding path program 2 times [2021-08-12 21:06:05,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:06:05,181 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099249950] [2021-08-12 21:06:05,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:06:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:06:05,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:05,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:06:05,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:05,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:06:05,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:05,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 21:06:05,228 INFO L142 QuantifierPusher]: treesize reduction 26, result has 56.7 percent of original size [2021-08-12 21:06:05,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-08-12 21:06:05,244 INFO L142 QuantifierPusher]: treesize reduction 52, result has 51.4 percent of original size [2021-08-12 21:06:05,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2021-08-12 21:06:05,264 INFO L142 QuantifierPusher]: treesize reduction 52, result has 52.7 percent of original size [2021-08-12 21:06:05,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 58 [2021-08-12 21:06:05,286 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 21:06:05,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 21:06:05,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:05,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:06:05,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:05,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:06:05,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:05,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:06:05,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:06:05,316 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:06:05,316 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099249950] [2021-08-12 21:06:05,316 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099249950] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:06:05,316 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:06:05,316 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 21:06:05,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722587179] [2021-08-12 21:06:05,317 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 21:06:05,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:06:05,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 21:06:05,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-08-12 21:06:05,318 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 106 [2021-08-12 21:06:05,318 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 1307 transitions, 18737 flow. Second operand has 10 states, 10 states have (on average 86.3) internal successors, (863), 10 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:05,318 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:06:05,318 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 106 [2021-08-12 21:06:05,319 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:06:05,507 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2021-08-12 21:06:11,489 INFO L129 PetriNetUnfolder]: 9928/28851 cut-off events. [2021-08-12 21:06:11,489 INFO L130 PetriNetUnfolder]: For 47819/53792 co-relation queries the response was YES. [2021-08-12 21:06:11,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117979 conditions, 28851 events. 9928/28851 cut-off events. For 47819/53792 co-relation queries the response was YES. Maximal size of possible extension queue 1814. Compared 379205 event pairs, 292 based on Foata normal form. 247/28942 useless extension candidates. Maximal degree in co-relation 117895. Up to 11574 conditions per place. [2021-08-12 21:06:11,612 INFO L132 encePairwiseOnDemand]: 94/106 looper letters, 33 selfloop transitions, 14 changer transitions 1581/1704 dead transitions. [2021-08-12 21:06:11,612 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 1704 transitions, 28109 flow [2021-08-12 21:06:11,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-12 21:06:11,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-08-12 21:06:11,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1530 transitions. [2021-08-12 21:06:11,614 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8490566037735849 [2021-08-12 21:06:11,614 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1530 transitions. [2021-08-12 21:06:11,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1530 transitions. [2021-08-12 21:06:11,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:06:11,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1530 transitions. [2021-08-12 21:06:11,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 90.0) internal successors, (1530), 17 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:11,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 106.0) internal successors, (1908), 18 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:11,619 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 106.0) internal successors, (1908), 18 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:11,620 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 93 predicate places. [2021-08-12 21:06:11,620 INFO L482 AbstractCegarLoop]: Abstraction has has 204 places, 1704 transitions, 28109 flow [2021-08-12 21:06:11,620 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 86.3) internal successors, (863), 10 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:11,620 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:06:11,620 INFO L266 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] [2021-08-12 21:06:11,620 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-12 21:06:11,620 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:06:11,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:06:11,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1918294437, now seen corresponding path program 1 times [2021-08-12 21:06:11,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:06:11,621 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619750564] [2021-08-12 21:06:11,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:06:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:06:11,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:11,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:06:11,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:11,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:06:11,657 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 21:06:11,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 21:06:11,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:11,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 21:06:11,673 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 21:06:11,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:06:11,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:11,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:06:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:06:11,680 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:06:11,680 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619750564] [2021-08-12 21:06:11,680 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619750564] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:06:11,680 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:06:11,680 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 21:06:11,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027851480] [2021-08-12 21:06:11,680 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 21:06:11,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:06:11,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 21:06:11,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 21:06:11,681 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-08-12 21:06:11,682 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 1704 transitions, 28109 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:11,682 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:06:11,682 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-08-12 21:06:11,682 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:06:15,765 INFO L129 PetriNetUnfolder]: 4086/13561 cut-off events. [2021-08-12 21:06:15,765 INFO L130 PetriNetUnfolder]: For 18472/20131 co-relation queries the response was YES. [2021-08-12 21:06:15,811 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51276 conditions, 13561 events. 4086/13561 cut-off events. For 18472/20131 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 167584 event pairs, 487 based on Foata normal form. 25/13160 useless extension candidates. Maximal degree in co-relation 51189. Up to 4998 conditions per place. [2021-08-12 21:06:15,839 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 24 selfloop transitions, 17 changer transitions 633/939 dead transitions. [2021-08-12 21:06:15,839 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 939 transitions, 14111 flow [2021-08-12 21:06:15,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 21:06:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-12 21:06:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 963 transitions. [2021-08-12 21:06:15,841 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9084905660377358 [2021-08-12 21:06:15,841 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 963 transitions. [2021-08-12 21:06:15,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 963 transitions. [2021-08-12 21:06:15,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:06:15,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 963 transitions. [2021-08-12 21:06:15,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.3) internal successors, (963), 10 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:15,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 106.0) internal successors, (1166), 11 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:15,844 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 106.0) internal successors, (1166), 11 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:15,844 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 102 predicate places. [2021-08-12 21:06:15,844 INFO L482 AbstractCegarLoop]: Abstraction has has 213 places, 939 transitions, 14111 flow [2021-08-12 21:06:15,845 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:15,845 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:06:15,845 INFO L266 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] [2021-08-12 21:06:15,845 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-12 21:06:15,845 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:06:15,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:06:15,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1509038905, now seen corresponding path program 1 times [2021-08-12 21:06:15,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:06:15,845 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058119168] [2021-08-12 21:06:15,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:06:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:06:15,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:15,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:06:15,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:15,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:06:15,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:15,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:06:15,886 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 21:06:15,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 21:06:15,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:15,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 21:06:15,902 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 21:06:15,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:06:15,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:15,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:06:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:06:15,909 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:06:15,909 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058119168] [2021-08-12 21:06:15,909 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058119168] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:06:15,909 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:06:15,909 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 21:06:15,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430270666] [2021-08-12 21:06:15,909 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 21:06:15,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:06:15,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 21:06:15,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 21:06:15,910 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-08-12 21:06:15,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 939 transitions, 14111 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:15,911 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:06:15,911 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-08-12 21:06:15,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:06:16,879 INFO L129 PetriNetUnfolder]: 1175/3998 cut-off events. [2021-08-12 21:06:16,879 INFO L130 PetriNetUnfolder]: For 2791/5915 co-relation queries the response was YES. [2021-08-12 21:06:16,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12742 conditions, 3998 events. 1175/3998 cut-off events. For 2791/5915 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 40983 event pairs, 27 based on Foata normal form. 501/4243 useless extension candidates. Maximal degree in co-relation 12652. Up to 767 conditions per place. [2021-08-12 21:06:16,898 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 22 selfloop transitions, 44 changer transitions 186/370 dead transitions. [2021-08-12 21:06:16,898 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 370 transitions, 4151 flow [2021-08-12 21:06:16,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 21:06:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-12 21:06:16,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1253 transitions. [2021-08-12 21:06:16,900 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.909288824383164 [2021-08-12 21:06:16,900 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1253 transitions. [2021-08-12 21:06:16,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1253 transitions. [2021-08-12 21:06:16,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:06:16,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1253 transitions. [2021-08-12 21:06:16,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.38461538461539) internal successors, (1253), 13 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:16,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:16,903 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:16,903 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 93 predicate places. [2021-08-12 21:06:16,903 INFO L482 AbstractCegarLoop]: Abstraction has has 204 places, 370 transitions, 4151 flow [2021-08-12 21:06:16,904 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:16,904 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:06:16,904 INFO L266 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] [2021-08-12 21:06:16,904 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-12 21:06:16,904 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:06:16,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:06:16,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1837875298, now seen corresponding path program 1 times [2021-08-12 21:06:16,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:06:16,904 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484661256] [2021-08-12 21:06:16,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:06:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:06:16,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:16,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:06:16,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:16,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:06:16,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:16,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:06:16,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:16,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:06:16,950 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 21:06:16,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 21:06:16,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:16,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 21:06:16,966 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 21:06:16,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:06:16,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:06:16,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:06:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:06:16,973 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:06:16,973 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484661256] [2021-08-12 21:06:16,973 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484661256] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:06:16,973 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:06:16,973 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 21:06:16,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737040728] [2021-08-12 21:06:16,974 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 21:06:16,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:06:16,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 21:06:16,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-12 21:06:16,974 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-08-12 21:06:16,975 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 370 transitions, 4151 flow. Second operand has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:16,975 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:06:16,975 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-08-12 21:06:16,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:06:17,560 INFO L129 PetriNetUnfolder]: 924/2798 cut-off events. [2021-08-12 21:06:17,560 INFO L130 PetriNetUnfolder]: For 1668/6516 co-relation queries the response was YES. [2021-08-12 21:06:17,570 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9374 conditions, 2798 events. 924/2798 cut-off events. For 1668/6516 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 28859 event pairs, 1 based on Foata normal form. 598/3179 useless extension candidates. Maximal degree in co-relation 9281. Up to 711 conditions per place. [2021-08-12 21:06:17,586 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 19 selfloop transitions, 48 changer transitions 80/233 dead transitions. [2021-08-12 21:06:17,586 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 233 transitions, 1789 flow [2021-08-12 21:06:17,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-12 21:06:17,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-12 21:06:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1528 transitions. [2021-08-12 21:06:17,603 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9009433962264151 [2021-08-12 21:06:17,603 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1528 transitions. [2021-08-12 21:06:17,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1528 transitions. [2021-08-12 21:06:17,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:06:17,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1528 transitions. [2021-08-12 21:06:17,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 95.5) internal successors, (1528), 16 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:17,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 106.0) internal successors, (1802), 17 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:17,609 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 106.0) internal successors, (1802), 17 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:17,609 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 75 predicate places. [2021-08-12 21:06:17,609 INFO L482 AbstractCegarLoop]: Abstraction has has 186 places, 233 transitions, 1789 flow [2021-08-12 21:06:17,609 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 21:06:17,609 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:06:17,609 INFO L266 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] [2021-08-12 21:06:17,609 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-12 21:06:17,609 INFO L430 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:06:17,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:06:17,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1347431726, now seen corresponding path program 1 times [2021-08-12 21:06:17,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:06:17,610 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711671196] [2021-08-12 21:06:17,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:06:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 21:06:17,692 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 21:06:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 21:06:17,760 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 21:06:17,799 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-12 21:06:17,799 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-12 21:06:17,799 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-12 21:06:17,801 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-12 21:06:17,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.08 09:06:17 BasicIcfg [2021-08-12 21:06:17,914 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-12 21:06:17,919 INFO L168 Benchmark]: Toolchain (without parser) took 26415.92 ms. Allocated memory was 163.6 MB in the beginning and 4.6 GB in the end (delta: 4.5 GB). Free memory was 126.8 MB in the beginning and 3.7 GB in the end (delta: -3.6 GB). Peak memory consumption was 868.7 MB. Max. memory is 8.0 GB. [2021-08-12 21:06:17,920 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 163.6 MB. Free memory is still 144.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-12 21:06:17,920 INFO L168 Benchmark]: CACSL2BoogieTranslator took 546.06 ms. Allocated memory is still 163.6 MB. Free memory was 126.6 MB in the beginning and 122.0 MB in the end (delta: 4.6 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2021-08-12 21:06:17,921 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.66 ms. Allocated memory is still 163.6 MB. Free memory was 122.0 MB in the beginning and 119.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-12 21:06:17,922 INFO L168 Benchmark]: Boogie Preprocessor took 31.44 ms. Allocated memory is still 163.6 MB. Free memory was 119.1 MB in the beginning and 117.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-12 21:06:17,923 INFO L168 Benchmark]: RCFGBuilder took 1288.52 ms. Allocated memory was 163.6 MB in the beginning and 198.2 MB in the end (delta: 34.6 MB). Free memory was 116.8 MB in the beginning and 113.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 60.1 MB. Max. memory is 8.0 GB. [2021-08-12 21:06:17,923 INFO L168 Benchmark]: TraceAbstraction took 24481.90 ms. Allocated memory was 198.2 MB in the beginning and 4.6 GB in the end (delta: 4.4 GB). Free memory was 112.8 MB in the beginning and 3.7 GB in the end (delta: -3.6 GB). Peak memory consumption was 818.1 MB. Max. memory is 8.0 GB. [2021-08-12 21:06:17,925 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.13 ms. Allocated memory is still 163.6 MB. Free memory is still 144.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 546.06 ms. Allocated memory is still 163.6 MB. Free memory was 126.6 MB in the beginning and 122.0 MB in the end (delta: 4.6 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 63.66 ms. Allocated memory is still 163.6 MB. Free memory was 122.0 MB in the beginning and 119.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 31.44 ms. Allocated memory is still 163.6 MB. Free memory was 119.1 MB in the beginning and 117.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1288.52 ms. Allocated memory was 163.6 MB in the beginning and 198.2 MB in the end (delta: 34.6 MB). Free memory was 116.8 MB in the beginning and 113.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 60.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 24481.90 ms. Allocated memory was 198.2 MB in the beginning and 4.6 GB in the end (delta: 4.4 GB). Free memory was 112.8 MB in the beginning and 3.7 GB in the end (delta: -3.6 GB). Peak memory consumption was 818.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L716] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L717] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L718] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L719] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L720] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L721] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L722] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L723] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L724] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L725] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L726] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L727] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L728] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L729] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L730] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L731] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L733] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L818] 0 pthread_t t2028; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L819] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] 0 pthread_t t2029; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L821] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] 0 pthread_t t2030; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L823] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 6.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 24296.3ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 22541.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 35.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 128 SDtfs, 498 SDslu, 441 SDs, 0 SdLazy, 894 SolverSat, 218 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 886.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1624.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=28109occurred in iteration=9, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 34.6ms SsaConstructionTime, 392.3ms SatisfiabilityAnalysisTime, 1035.4ms InterpolantComputationTime, 934 NumberOfCodeBlocks, 934 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 840 ConstructedInterpolants, 0 QuantifiedInterpolants, 3653 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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! Received shutdown request...