/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-OGIterative.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 01:23:03,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 01:23:03,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 01:23:03,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 01:23:03,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 01:23:03,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 01:23:03,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 01:23:03,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 01:23:03,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 01:23:03,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 01:23:03,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 01:23:03,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 01:23:03,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 01:23:03,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 01:23:03,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 01:23:03,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 01:23:03,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 01:23:03,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 01:23:03,062 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 01:23:03,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 01:23:03,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 01:23:03,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 01:23:03,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 01:23:03,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 01:23:03,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 01:23:03,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 01:23:03,086 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 01:23:03,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 01:23:03,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 01:23:03,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 01:23:03,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 01:23:03,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 01:23:03,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 01:23:03,091 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 01:23:03,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 01:23:03,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 01:23:03,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 01:23:03,093 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 01:23:03,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 01:23:03,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 01:23:03,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 01:23:03,095 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-OGIterative.epf [2021-08-13 01:23:03,131 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 01:23:03,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 01:23:03,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 01:23:03,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 01:23:03,135 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 01:23:03,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 01:23:03,135 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 01:23:03,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 01:23:03,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 01:23:03,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 01:23:03,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 01:23:03,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 01:23:03,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 01:23:03,136 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 01:23:03,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 01:23:03,137 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 01:23:03,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 01:23:03,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 01:23:03,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 01:23:03,137 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 01:23:03,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 01:23:03,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 01:23:03,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 01:23:03,138 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 01:23:03,138 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 01:23:03,139 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 01:23:03,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 01:23:03,139 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 01:23:03,139 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 01:23:03,139 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 01:23:03,139 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 01:23:03,139 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-13 01:23:03,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 01:23:03,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 01:23:03,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 01:23:03,446 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-13 01:23:03,446 INFO L275 PluginConnector]: CDTParser initialized [2021-08-13 01:23:03,447 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2021-08-13 01:23:03,496 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ebffdc4b/9b03a578facb4ed1b5484aef185cbe0f/FLAG05433e32b [2021-08-13 01:23:04,043 INFO L306 CDTParser]: Found 1 translation units. [2021-08-13 01:23:04,043 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2021-08-13 01:23:04,058 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ebffdc4b/9b03a578facb4ed1b5484aef185cbe0f/FLAG05433e32b [2021-08-13 01:23:04,342 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ebffdc4b/9b03a578facb4ed1b5484aef185cbe0f [2021-08-13 01:23:04,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 01:23:04,345 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-13 01:23:04,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-13 01:23:04,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-13 01:23:04,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-13 01:23:04,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 01:23:04" (1/1) ... [2021-08-13 01:23:04,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13804be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:23:04, skipping insertion in model container [2021-08-13 01:23:04,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 01:23:04" (1/1) ... [2021-08-13 01:23:04,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-13 01:23:04,416 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-13 01:23:04,544 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/safe029_power.opt.i[951,964] [2021-08-13 01:23:04,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 01:23:04,769 INFO L203 MainTranslator]: Completed pre-run [2021-08-13 01:23:04,801 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/safe029_power.opt.i[951,964] [2021-08-13 01:23:04,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 01:23:04,942 INFO L208 MainTranslator]: Completed translation [2021-08-13 01:23:04,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:23:04 WrapperNode [2021-08-13 01:23:04,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-13 01:23:04,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 01:23:04,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 01:23:04,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 01:23:04,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:23:04" (1/1) ... [2021-08-13 01:23:04,981 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:23:04" (1/1) ... [2021-08-13 01:23:05,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 01:23:05,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 01:23:05,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 01:23:05,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 01:23:05,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:23:04" (1/1) ... [2021-08-13 01:23:05,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:23:04" (1/1) ... [2021-08-13 01:23:05,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:23:04" (1/1) ... [2021-08-13 01:23:05,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:23:04" (1/1) ... [2021-08-13 01:23:05,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:23:04" (1/1) ... [2021-08-13 01:23:05,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:23:04" (1/1) ... [2021-08-13 01:23:05,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:23:04" (1/1) ... [2021-08-13 01:23:05,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 01:23:05,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 01:23:05,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 01:23:05,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 01:23:05,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:23:04" (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-13 01:23:05,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-13 01:23:05,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-13 01:23:05,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-13 01:23:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-13 01:23:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-13 01:23:05,158 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-13 01:23:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-13 01:23:05,158 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-13 01:23:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-13 01:23:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-13 01:23:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 01:23:05,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 01:23:05,160 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-13 01:23:06,842 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 01:23:06,843 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-13 01:23:06,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 01:23:06 BoogieIcfgContainer [2021-08-13 01:23:06,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 01:23:06,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 01:23:06,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 01:23:06,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 01:23:06,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 01:23:04" (1/3) ... [2021-08-13 01:23:06,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@221d05c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 01:23:06, skipping insertion in model container [2021-08-13 01:23:06,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:23:04" (2/3) ... [2021-08-13 01:23:06,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@221d05c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 01:23:06, skipping insertion in model container [2021-08-13 01:23:06,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 01:23:06" (3/3) ... [2021-08-13 01:23:06,851 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.opt.i [2021-08-13 01:23:06,857 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 01:23:06,857 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 01:23:06,858 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 01:23:06,891 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,891 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,891 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,891 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,891 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,892 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,892 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,892 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,893 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,893 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,893 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,893 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,893 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,897 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,897 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,897 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,897 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,897 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,898 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,898 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,898 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,900 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,900 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,901 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,904 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,904 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,904 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,906 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,906 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,907 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,911 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,911 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:23:06,912 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-13 01:23:06,932 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-08-13 01:23:06,950 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 01:23:06,950 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 01:23:06,950 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 01:23:06,950 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 01:23:06,950 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 01:23:06,950 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 01:23:06,950 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 01:23:06,951 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 01:23:06,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 180 flow [2021-08-13 01:23:06,988 INFO L129 PetriNetUnfolder]: 2/83 cut-off events. [2021-08-13 01:23:06,989 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 01:23:06,992 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 83 events. 2/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2021-08-13 01:23:06,992 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 85 transitions, 180 flow [2021-08-13 01:23:06,996 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 83 transitions, 172 flow [2021-08-13 01:23:07,007 INFO L129 PetriNetUnfolder]: 0/51 cut-off events. [2021-08-13 01:23:07,007 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 01:23:07,007 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:23:07,008 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] [2021-08-13 01:23:07,008 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:23:07,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:23:07,013 INFO L82 PathProgramCache]: Analyzing trace with hash 100820283, now seen corresponding path program 1 times [2021-08-13 01:23:07,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:23:07,020 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054814431] [2021-08-13 01:23:07,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:23:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:23:07,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:07,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:07,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:07,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:23:07,217 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-13 01:23:07,217 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:23:07,218 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054814431] [2021-08-13 01:23:07,218 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054814431] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:23:07,218 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:23:07,219 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 01:23:07,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133459138] [2021-08-13 01:23:07,226 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 01:23:07,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:23:07,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 01:23:07,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 01:23:07,238 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 85 [2021-08-13 01:23:07,241 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 83 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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-13 01:23:07,241 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:23:07,241 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 85 [2021-08-13 01:23:07,242 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:23:07,308 INFO L129 PetriNetUnfolder]: 16/143 cut-off events. [2021-08-13 01:23:07,308 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 01:23:07,309 INFO L84 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 143 events. 16/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 359 event pairs, 2 based on Foata normal form. 7/143 useless extension candidates. Maximal degree in co-relation 143. Up to 27 conditions per place. [2021-08-13 01:23:07,311 INFO L132 encePairwiseOnDemand]: 80/85 looper letters, 7 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2021-08-13 01:23:07,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 82 transitions, 188 flow [2021-08-13 01:23:07,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 01:23:07,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 01:23:07,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2021-08-13 01:23:07,322 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9372549019607843 [2021-08-13 01:23:07,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 239 transitions. [2021-08-13 01:23:07,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 239 transitions. [2021-08-13 01:23:07,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:23:07,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 239 transitions. [2021-08-13 01:23:07,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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-13 01:23:07,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 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-13 01:23:07,333 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 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-13 01:23:07,333 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 0 predicate places. [2021-08-13 01:23:07,334 INFO L482 AbstractCegarLoop]: Abstraction has has 88 places, 82 transitions, 188 flow [2021-08-13 01:23:07,334 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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-13 01:23:07,334 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:23:07,334 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] [2021-08-13 01:23:07,334 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 01:23:07,335 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:23:07,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:23:07,335 INFO L82 PathProgramCache]: Analyzing trace with hash 453548779, now seen corresponding path program 1 times [2021-08-13 01:23:07,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:23:07,336 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700549823] [2021-08-13 01:23:07,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:23:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:23:07,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:07,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:07,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:07,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:23:07,528 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:23:07,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:23:07,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:07,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:07,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:07,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:07,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:07,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:07,610 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-13 01:23:07,610 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:23:07,610 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700549823] [2021-08-13 01:23:07,610 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700549823] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:23:07,610 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:23:07,610 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 01:23:07,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727646811] [2021-08-13 01:23:07,611 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 01:23:07,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:23:07,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 01:23:07,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 01:23:07,614 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-08-13 01:23:07,614 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 82 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 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-13 01:23:07,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:23:07,615 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-08-13 01:23:07,615 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:23:07,838 INFO L129 PetriNetUnfolder]: 70/414 cut-off events. [2021-08-13 01:23:07,838 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-08-13 01:23:07,841 INFO L84 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 414 events. 70/414 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2412 event pairs, 24 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 580. Up to 85 conditions per place. [2021-08-13 01:23:07,842 INFO L132 encePairwiseOnDemand]: 78/85 looper letters, 10 selfloop transitions, 3 changer transitions 22/106 dead transitions. [2021-08-13 01:23:07,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 106 transitions, 310 flow [2021-08-13 01:23:07,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 01:23:07,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 01:23:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 683 transitions. [2021-08-13 01:23:07,847 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8928104575163399 [2021-08-13 01:23:07,847 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 683 transitions. [2021-08-13 01:23:07,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 683 transitions. [2021-08-13 01:23:07,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:23:07,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 683 transitions. [2021-08-13 01:23:07,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 75.88888888888889) internal successors, (683), 9 states have internal predecessors, (683), 0 states have call successors, (0), 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-13 01:23:07,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 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-13 01:23:07,853 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 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-13 01:23:07,886 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 8 predicate places. [2021-08-13 01:23:07,886 INFO L482 AbstractCegarLoop]: Abstraction has has 96 places, 106 transitions, 310 flow [2021-08-13 01:23:07,887 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 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-13 01:23:07,887 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:23:07,887 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] [2021-08-13 01:23:07,887 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 01:23:07,887 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:23:07,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:23:07,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1880103562, now seen corresponding path program 1 times [2021-08-13 01:23:07,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:23:07,888 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381335677] [2021-08-13 01:23:07,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:23:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:23:08,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:08,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:08,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:08,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:23:08,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:08,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:23:08,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:08,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 01:23:08,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:08,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 01:23:08,063 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-08-13 01:23:08,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-08-13 01:23:08,084 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:23:08,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:23:08,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:08,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:08,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:08,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:08,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:08,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:08,132 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-13 01:23:08,132 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:23:08,132 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381335677] [2021-08-13 01:23:08,132 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381335677] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:23:08,132 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:23:08,133 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 01:23:08,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162021377] [2021-08-13 01:23:08,133 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 01:23:08,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:23:08,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 01:23:08,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-13 01:23:08,135 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 85 [2021-08-13 01:23:08,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 106 transitions, 310 flow. Second operand has 10 states, 10 states have (on average 66.1) internal successors, (661), 10 states have internal predecessors, (661), 0 states have call successors, (0), 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-13 01:23:08,137 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:23:08,137 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 85 [2021-08-13 01:23:08,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:23:08,576 INFO L129 PetriNetUnfolder]: 373/1242 cut-off events. [2021-08-13 01:23:08,576 INFO L130 PetriNetUnfolder]: For 281/347 co-relation queries the response was YES. [2021-08-13 01:23:08,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2435 conditions, 1242 events. 373/1242 cut-off events. For 281/347 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9278 event pairs, 96 based on Foata normal form. 2/1209 useless extension candidates. Maximal degree in co-relation 2384. Up to 293 conditions per place. [2021-08-13 01:23:08,585 INFO L132 encePairwiseOnDemand]: 73/85 looper letters, 15 selfloop transitions, 10 changer transitions 91/174 dead transitions. [2021-08-13 01:23:08,586 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 174 transitions, 760 flow [2021-08-13 01:23:08,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-13 01:23:08,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-08-13 01:23:08,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1038 transitions. [2021-08-13 01:23:08,591 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8141176470588235 [2021-08-13 01:23:08,591 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1038 transitions. [2021-08-13 01:23:08,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1038 transitions. [2021-08-13 01:23:08,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:23:08,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1038 transitions. [2021-08-13 01:23:08,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 69.2) internal successors, (1038), 15 states have internal predecessors, (1038), 0 states have call successors, (0), 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-13 01:23:08,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 85.0) internal successors, (1360), 16 states have internal predecessors, (1360), 0 states have call successors, (0), 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-13 01:23:08,599 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 85.0) internal successors, (1360), 16 states have internal predecessors, (1360), 0 states have call successors, (0), 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-13 01:23:08,599 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 22 predicate places. [2021-08-13 01:23:08,599 INFO L482 AbstractCegarLoop]: Abstraction has has 110 places, 174 transitions, 760 flow [2021-08-13 01:23:08,599 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 66.1) internal successors, (661), 10 states have internal predecessors, (661), 0 states have call successors, (0), 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-13 01:23:08,599 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:23:08,599 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] [2021-08-13 01:23:08,600 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 01:23:08,600 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:23:08,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:23:08,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1628271010, now seen corresponding path program 1 times [2021-08-13 01:23:08,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:23:08,601 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443500175] [2021-08-13 01:23:08,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:23:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:23:08,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:08,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:08,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:08,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:23:08,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:08,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:23:08,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:08,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 01:23:08,783 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-08-13 01:23:08,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-13 01:23:08,790 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:23:08,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:23:08,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:08,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:08,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:08,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:08,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:08,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:08,824 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-13 01:23:08,825 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:23:08,825 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443500175] [2021-08-13 01:23:08,825 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443500175] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:23:08,825 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:23:08,825 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 01:23:08,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671142787] [2021-08-13 01:23:08,826 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 01:23:08,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:23:08,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 01:23:08,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-13 01:23:08,827 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 85 [2021-08-13 01:23:08,828 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 174 transitions, 760 flow. Second operand has 8 states, 8 states have (on average 68.375) internal successors, (547), 8 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 01:23:08,828 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:23:08,828 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 85 [2021-08-13 01:23:08,828 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:23:09,202 INFO L129 PetriNetUnfolder]: 410/1409 cut-off events. [2021-08-13 01:23:09,203 INFO L130 PetriNetUnfolder]: For 464/709 co-relation queries the response was YES. [2021-08-13 01:23:09,207 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3479 conditions, 1409 events. 410/1409 cut-off events. For 464/709 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11394 event pairs, 61 based on Foata normal form. 11/1387 useless extension candidates. Maximal degree in co-relation 3423. Up to 432 conditions per place. [2021-08-13 01:23:09,212 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 25 selfloop transitions, 8 changer transitions 144/236 dead transitions. [2021-08-13 01:23:09,212 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 236 transitions, 1452 flow [2021-08-13 01:23:09,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-13 01:23:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-08-13 01:23:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 790 transitions. [2021-08-13 01:23:09,215 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8449197860962567 [2021-08-13 01:23:09,215 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 790 transitions. [2021-08-13 01:23:09,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 790 transitions. [2021-08-13 01:23:09,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:23:09,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 790 transitions. [2021-08-13 01:23:09,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 71.81818181818181) internal successors, (790), 11 states have internal predecessors, (790), 0 states have call successors, (0), 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-13 01:23:09,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 85.0) internal successors, (1020), 12 states have internal predecessors, (1020), 0 states have call successors, (0), 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-13 01:23:09,220 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 85.0) internal successors, (1020), 12 states have internal predecessors, (1020), 0 states have call successors, (0), 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-13 01:23:09,221 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 32 predicate places. [2021-08-13 01:23:09,221 INFO L482 AbstractCegarLoop]: Abstraction has has 120 places, 236 transitions, 1452 flow [2021-08-13 01:23:09,222 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 68.375) internal successors, (547), 8 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 01:23:09,222 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:23:09,222 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] [2021-08-13 01:23:09,222 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 01:23:09,222 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:23:09,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:23:09,223 INFO L82 PathProgramCache]: Analyzing trace with hash 771141581, now seen corresponding path program 1 times [2021-08-13 01:23:09,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:23:09,223 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743470260] [2021-08-13 01:23:09,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:23:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:23:09,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:09,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:09,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:09,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:23:09,315 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:23:09,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:23:09,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:09,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:09,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:09,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:09,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:09,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:09,347 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-13 01:23:09,347 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:23:09,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743470260] [2021-08-13 01:23:09,347 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743470260] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:23:09,348 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:23:09,348 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 01:23:09,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037131913] [2021-08-13 01:23:09,348 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 01:23:09,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:23:09,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 01:23:09,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 01:23:09,350 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-08-13 01:23:09,350 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 236 transitions, 1452 flow. Second operand has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 0 states have call successors, (0), 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-13 01:23:09,350 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:23:09,351 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-08-13 01:23:09,351 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:23:09,743 INFO L129 PetriNetUnfolder]: 638/2227 cut-off events. [2021-08-13 01:23:09,743 INFO L130 PetriNetUnfolder]: For 1297/1857 co-relation queries the response was YES. [2021-08-13 01:23:09,748 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6249 conditions, 2227 events. 638/2227 cut-off events. For 1297/1857 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 20476 event pairs, 67 based on Foata normal form. 7/2200 useless extension candidates. Maximal degree in co-relation 6190. Up to 776 conditions per place. [2021-08-13 01:23:09,753 INFO L132 encePairwiseOnDemand]: 79/85 looper letters, 22 selfloop transitions, 3 changer transitions 216/316 dead transitions. [2021-08-13 01:23:09,753 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 316 transitions, 2440 flow [2021-08-13 01:23:09,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 01:23:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 01:23:09,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 678 transitions. [2021-08-13 01:23:09,755 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8862745098039215 [2021-08-13 01:23:09,755 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 678 transitions. [2021-08-13 01:23:09,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 678 transitions. [2021-08-13 01:23:09,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:23:09,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 678 transitions. [2021-08-13 01:23:09,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 75.33333333333333) internal successors, (678), 9 states have internal predecessors, (678), 0 states have call successors, (0), 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-13 01:23:09,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 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-13 01:23:09,760 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 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-13 01:23:09,761 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 40 predicate places. [2021-08-13 01:23:09,761 INFO L482 AbstractCegarLoop]: Abstraction has has 128 places, 316 transitions, 2440 flow [2021-08-13 01:23:09,761 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 0 states have call successors, (0), 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-13 01:23:09,761 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:23:09,761 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] [2021-08-13 01:23:09,762 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 01:23:09,762 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:23:09,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:23:09,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1118098985, now seen corresponding path program 1 times [2021-08-13 01:23:09,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:23:09,763 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296430384] [2021-08-13 01:23:09,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:23:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:23:09,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:09,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:09,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:09,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:23:09,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:09,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:23:09,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:09,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 01:23:09,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:09,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 01:23:09,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:09,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 01:23:09,964 INFO L142 QuantifierPusher]: treesize reduction 10, result has 56.5 percent of original size [2021-08-13 01:23:09,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 01:23:09,983 INFO L142 QuantifierPusher]: treesize reduction 20, result has 79.6 percent of original size [2021-08-13 01:23:09,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2021-08-13 01:23:10,011 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:23:10,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:23:10,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:10,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:10,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:10,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:10,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:10,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:10,054 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-13 01:23:10,054 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:23:10,055 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296430384] [2021-08-13 01:23:10,055 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296430384] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:23:10,055 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:23:10,055 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-13 01:23:10,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628150665] [2021-08-13 01:23:10,056 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-13 01:23:10,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:23:10,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-13 01:23:10,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-08-13 01:23:10,059 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 85 [2021-08-13 01:23:10,060 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 316 transitions, 2440 flow. Second operand has 12 states, 12 states have (on average 65.16666666666667) internal successors, (782), 12 states have internal predecessors, (782), 0 states have call successors, (0), 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-13 01:23:10,060 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:23:10,060 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 85 [2021-08-13 01:23:10,061 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:23:10,796 INFO L129 PetriNetUnfolder]: 747/2599 cut-off events. [2021-08-13 01:23:10,796 INFO L130 PetriNetUnfolder]: For 2050/3577 co-relation queries the response was YES. [2021-08-13 01:23:10,802 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8713 conditions, 2599 events. 747/2599 cut-off events. For 2050/3577 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 24545 event pairs, 69 based on Foata normal form. 22/2588 useless extension candidates. Maximal degree in co-relation 8647. Up to 1042 conditions per place. [2021-08-13 01:23:10,807 INFO L132 encePairwiseOnDemand]: 73/85 looper letters, 33 selfloop transitions, 8 changer transitions 369/467 dead transitions. [2021-08-13 01:23:10,807 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 467 transitions, 4664 flow [2021-08-13 01:23:10,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-13 01:23:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-08-13 01:23:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1161 transitions. [2021-08-13 01:23:10,811 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8034602076124567 [2021-08-13 01:23:10,811 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1161 transitions. [2021-08-13 01:23:10,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1161 transitions. [2021-08-13 01:23:10,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:23:10,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1161 transitions. [2021-08-13 01:23:10,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 68.29411764705883) internal successors, (1161), 17 states have internal predecessors, (1161), 0 states have call successors, (0), 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-13 01:23:10,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 85.0) internal successors, (1530), 18 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-13 01:23:10,818 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 85.0) internal successors, (1530), 18 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-13 01:23:10,818 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 56 predicate places. [2021-08-13 01:23:10,818 INFO L482 AbstractCegarLoop]: Abstraction has has 144 places, 467 transitions, 4664 flow [2021-08-13 01:23:10,818 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 65.16666666666667) internal successors, (782), 12 states have internal predecessors, (782), 0 states have call successors, (0), 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-13 01:23:10,818 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:23:10,818 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] [2021-08-13 01:23:10,819 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 01:23:10,819 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:23:10,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:23:10,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1453690570, now seen corresponding path program 1 times [2021-08-13 01:23:10,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:23:10,819 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951232328] [2021-08-13 01:23:10,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:23:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:23:10,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:10,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:10,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:10,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:23:10,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:10,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:23:10,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:10,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 01:23:10,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:10,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-08-13 01:23:10,955 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.1 percent of original size [2021-08-13 01:23:10,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-08-13 01:23:10,979 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:23:10,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:23:11,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:11,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:11,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:11,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:11,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:11,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:11,026 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-13 01:23:11,026 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:23:11,026 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951232328] [2021-08-13 01:23:11,026 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951232328] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:23:11,027 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:23:11,027 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 01:23:11,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873601092] [2021-08-13 01:23:11,028 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 01:23:11,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:23:11,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 01:23:11,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-13 01:23:11,030 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 85 [2021-08-13 01:23:11,030 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 467 transitions, 4664 flow. Second operand has 10 states, 10 states have (on average 66.2) internal successors, (662), 10 states have internal predecessors, (662), 0 states have call successors, (0), 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-13 01:23:11,030 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:23:11,030 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 85 [2021-08-13 01:23:11,031 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:23:11,958 INFO L129 PetriNetUnfolder]: 1071/3902 cut-off events. [2021-08-13 01:23:11,958 INFO L130 PetriNetUnfolder]: For 3826/5388 co-relation queries the response was YES. [2021-08-13 01:23:11,969 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14646 conditions, 3902 events. 1071/3902 cut-off events. For 3826/5388 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 41262 event pairs, 69 based on Foata normal form. 32/3902 useless extension candidates. Maximal degree in co-relation 14574. Up to 1637 conditions per place. [2021-08-13 01:23:11,976 INFO L132 encePairwiseOnDemand]: 73/85 looper letters, 37 selfloop transitions, 12 changer transitions 533/640 dead transitions. [2021-08-13 01:23:11,976 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 640 transitions, 7760 flow [2021-08-13 01:23:11,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 01:23:11,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 01:23:11,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1103 transitions. [2021-08-13 01:23:11,979 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8110294117647059 [2021-08-13 01:23:11,979 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1103 transitions. [2021-08-13 01:23:11,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1103 transitions. [2021-08-13 01:23:11,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:23:11,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1103 transitions. [2021-08-13 01:23:11,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 68.9375) internal successors, (1103), 16 states have internal predecessors, (1103), 0 states have call successors, (0), 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-13 01:23:11,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 85.0) internal successors, (1445), 17 states have internal predecessors, (1445), 0 states have call successors, (0), 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-13 01:23:11,985 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 85.0) internal successors, (1445), 17 states have internal predecessors, (1445), 0 states have call successors, (0), 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-13 01:23:11,985 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 71 predicate places. [2021-08-13 01:23:11,985 INFO L482 AbstractCegarLoop]: Abstraction has has 159 places, 640 transitions, 7760 flow [2021-08-13 01:23:11,985 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 66.2) internal successors, (662), 10 states have internal predecessors, (662), 0 states have call successors, (0), 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-13 01:23:11,985 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:23:11,985 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] [2021-08-13 01:23:11,986 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-13 01:23:11,986 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:23:11,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:23:11,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1936241010, now seen corresponding path program 2 times [2021-08-13 01:23:11,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:23:11,986 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678727447] [2021-08-13 01:23:11,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:23:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:23:12,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:12,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:12,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:12,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:23:12,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:12,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:23:12,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:12,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 01:23:12,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:12,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 01:23:12,080 INFO L142 QuantifierPusher]: treesize reduction 31, result has 69.9 percent of original size [2021-08-13 01:23:12,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 72 [2021-08-13 01:23:12,116 INFO L142 QuantifierPusher]: treesize reduction 36, result has 65.4 percent of original size [2021-08-13 01:23:12,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-08-13 01:23:12,144 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:23:12,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:23:12,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:12,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:12,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:12,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:12,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:12,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:12,184 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-13 01:23:12,184 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:23:12,185 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678727447] [2021-08-13 01:23:12,185 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678727447] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:23:12,185 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:23:12,185 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-13 01:23:12,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142680053] [2021-08-13 01:23:12,185 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-13 01:23:12,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:23:12,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-13 01:23:12,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-08-13 01:23:12,188 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 85 [2021-08-13 01:23:12,189 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 640 transitions, 7760 flow. Second operand has 11 states, 11 states have (on average 65.18181818181819) internal successors, (717), 11 states have internal predecessors, (717), 0 states have call successors, (0), 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-13 01:23:12,189 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:23:12,189 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 85 [2021-08-13 01:23:12,189 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:23:13,245 INFO L129 PetriNetUnfolder]: 1111/4318 cut-off events. [2021-08-13 01:23:13,246 INFO L130 PetriNetUnfolder]: For 5389/7761 co-relation queries the response was YES. [2021-08-13 01:23:13,257 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17696 conditions, 4318 events. 1111/4318 cut-off events. For 5389/7761 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 47764 event pairs, 10 based on Foata normal form. 69/4367 useless extension candidates. Maximal degree in co-relation 17617. Up to 1744 conditions per place. [2021-08-13 01:23:13,264 INFO L132 encePairwiseOnDemand]: 73/85 looper letters, 30 selfloop transitions, 15 changer transitions 610/712 dead transitions. [2021-08-13 01:23:13,264 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 712 transitions, 9980 flow [2021-08-13 01:23:13,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-13 01:23:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-08-13 01:23:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1151 transitions. [2021-08-13 01:23:13,267 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.7965397923875432 [2021-08-13 01:23:13,267 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1151 transitions. [2021-08-13 01:23:13,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1151 transitions. [2021-08-13 01:23:13,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:23:13,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1151 transitions. [2021-08-13 01:23:13,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 67.70588235294117) internal successors, (1151), 17 states have internal predecessors, (1151), 0 states have call successors, (0), 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-13 01:23:13,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 85.0) internal successors, (1530), 18 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-13 01:23:13,273 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 85.0) internal successors, (1530), 18 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-13 01:23:13,273 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 87 predicate places. [2021-08-13 01:23:13,273 INFO L482 AbstractCegarLoop]: Abstraction has has 175 places, 712 transitions, 9980 flow [2021-08-13 01:23:13,274 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 65.18181818181819) internal successors, (717), 11 states have internal predecessors, (717), 0 states have call successors, (0), 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-13 01:23:13,274 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:23:13,274 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] [2021-08-13 01:23:13,274 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-13 01:23:13,274 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:23:13,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:23:13,275 INFO L82 PathProgramCache]: Analyzing trace with hash -380146845, now seen corresponding path program 1 times [2021-08-13 01:23:13,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:23:13,275 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517263752] [2021-08-13 01:23:13,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:23:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:23:13,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:13,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:13,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:13,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:23:13,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:13,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:23:13,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:13,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 01:23:13,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:13,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 01:23:13,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:13,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 01:23:13,375 INFO L142 QuantifierPusher]: treesize reduction 10, result has 85.1 percent of original size [2021-08-13 01:23:13,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-08-13 01:23:13,406 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.4 percent of original size [2021-08-13 01:23:13,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-08-13 01:23:13,437 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.8 percent of original size [2021-08-13 01:23:13,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-08-13 01:23:13,453 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:23:13,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:23:13,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:13,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:13,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:13,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:13,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:13,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:13,500 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-13 01:23:13,500 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:23:13,500 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517263752] [2021-08-13 01:23:13,501 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517263752] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:23:13,501 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:23:13,501 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-13 01:23:13,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118855867] [2021-08-13 01:23:13,501 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-08-13 01:23:13,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:23:13,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-13 01:23:13,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-08-13 01:23:13,503 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 85 [2021-08-13 01:23:13,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 712 transitions, 9980 flow. Second operand has 13 states, 13 states have (on average 62.38461538461539) internal successors, (811), 13 states have internal predecessors, (811), 0 states have call successors, (0), 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-13 01:23:13,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:23:13,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 85 [2021-08-13 01:23:13,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:23:14,840 INFO L129 PetriNetUnfolder]: 1212/4734 cut-off events. [2021-08-13 01:23:14,841 INFO L130 PetriNetUnfolder]: For 7847/12052 co-relation queries the response was YES. [2021-08-13 01:23:14,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21693 conditions, 4734 events. 1212/4734 cut-off events. For 7847/12052 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 53567 event pairs, 10 based on Foata normal form. 38/4752 useless extension candidates. Maximal degree in co-relation 21604. Up to 1929 conditions per place. [2021-08-13 01:23:14,859 INFO L132 encePairwiseOnDemand]: 72/85 looper letters, 37 selfloop transitions, 9 changer transitions 737/837 dead transitions. [2021-08-13 01:23:14,859 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 837 transitions, 13440 flow [2021-08-13 01:23:14,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-13 01:23:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-08-13 01:23:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1303 transitions. [2021-08-13 01:23:14,863 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.7664705882352941 [2021-08-13 01:23:14,863 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1303 transitions. [2021-08-13 01:23:14,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1303 transitions. [2021-08-13 01:23:14,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:23:14,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1303 transitions. [2021-08-13 01:23:14,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 65.15) internal successors, (1303), 20 states have internal predecessors, (1303), 0 states have call successors, (0), 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-13 01:23:14,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 85.0) internal successors, (1785), 21 states have internal predecessors, (1785), 0 states have call successors, (0), 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-13 01:23:14,869 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 85.0) internal successors, (1785), 21 states have internal predecessors, (1785), 0 states have call successors, (0), 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-13 01:23:14,869 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 106 predicate places. [2021-08-13 01:23:14,870 INFO L482 AbstractCegarLoop]: Abstraction has has 194 places, 837 transitions, 13440 flow [2021-08-13 01:23:14,870 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 62.38461538461539) internal successors, (811), 13 states have internal predecessors, (811), 0 states have call successors, (0), 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-13 01:23:14,870 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:23:14,870 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] [2021-08-13 01:23:14,870 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-13 01:23:14,870 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:23:14,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:23:14,871 INFO L82 PathProgramCache]: Analyzing trace with hash -944258453, now seen corresponding path program 2 times [2021-08-13 01:23:14,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:23:14,871 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517808186] [2021-08-13 01:23:14,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:23:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:23:14,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:14,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:14,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:14,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:23:14,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:14,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:23:14,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:14,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 01:23:14,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:14,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 01:23:14,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:14,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 01:23:14,978 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-08-13 01:23:14,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-08-13 01:23:15,006 INFO L142 QuantifierPusher]: treesize reduction 47, result has 58.4 percent of original size [2021-08-13 01:23:15,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2021-08-13 01:23:15,038 INFO L142 QuantifierPusher]: treesize reduction 47, result has 59.1 percent of original size [2021-08-13 01:23:15,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-08-13 01:23:15,067 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:23:15,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:23:15,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:15,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:15,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:15,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:15,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:15,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:15,109 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-13 01:23:15,110 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:23:15,110 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517808186] [2021-08-13 01:23:15,110 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517808186] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:23:15,110 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:23:15,110 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-13 01:23:15,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482698884] [2021-08-13 01:23:15,111 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-08-13 01:23:15,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:23:15,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-13 01:23:15,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-08-13 01:23:15,112 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 85 [2021-08-13 01:23:15,113 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 837 transitions, 13440 flow. Second operand has 13 states, 13 states have (on average 64.23076923076923) internal successors, (835), 13 states have internal predecessors, (835), 0 states have call successors, (0), 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-13 01:23:15,113 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:23:15,113 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 85 [2021-08-13 01:23:15,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:23:16,410 INFO L129 PetriNetUnfolder]: 1220/4756 cut-off events. [2021-08-13 01:23:16,410 INFO L130 PetriNetUnfolder]: For 8982/12548 co-relation queries the response was YES. [2021-08-13 01:23:16,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24152 conditions, 4756 events. 1220/4756 cut-off events. For 8982/12548 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 53732 event pairs, 10 based on Foata normal form. 40/4776 useless extension candidates. Maximal degree in co-relation 24055. Up to 1950 conditions per place. [2021-08-13 01:23:16,436 INFO L132 encePairwiseOnDemand]: 73/85 looper letters, 34 selfloop transitions, 6 changer transitions 775/871 dead transitions. [2021-08-13 01:23:16,437 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 871 transitions, 15634 flow [2021-08-13 01:23:16,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-13 01:23:16,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-08-13 01:23:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1340 transitions. [2021-08-13 01:23:16,440 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.788235294117647 [2021-08-13 01:23:16,440 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1340 transitions. [2021-08-13 01:23:16,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1340 transitions. [2021-08-13 01:23:16,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:23:16,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1340 transitions. [2021-08-13 01:23:16,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 67.0) internal successors, (1340), 20 states have internal predecessors, (1340), 0 states have call successors, (0), 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-13 01:23:16,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 85.0) internal successors, (1785), 21 states have internal predecessors, (1785), 0 states have call successors, (0), 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-13 01:23:16,446 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 85.0) internal successors, (1785), 21 states have internal predecessors, (1785), 0 states have call successors, (0), 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-13 01:23:16,446 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 125 predicate places. [2021-08-13 01:23:16,446 INFO L482 AbstractCegarLoop]: Abstraction has has 213 places, 871 transitions, 15634 flow [2021-08-13 01:23:16,446 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 64.23076923076923) internal successors, (835), 13 states have internal predecessors, (835), 0 states have call successors, (0), 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-13 01:23:16,446 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:23:16,447 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] [2021-08-13 01:23:16,447 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-13 01:23:16,447 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:23:16,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:23:16,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1400716705, now seen corresponding path program 3 times [2021-08-13 01:23:16,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:23:16,448 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643129066] [2021-08-13 01:23:16,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:23:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:23:16,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:16,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:16,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:16,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:23:16,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:16,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:23:16,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:16,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 01:23:16,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:16,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 01:23:16,633 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-08-13 01:23:16,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-08-13 01:23:16,640 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-08-13 01:23:16,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-13 01:23:16,657 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:23:16,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:23:16,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:16,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:16,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:16,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:16,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:16,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:16,697 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-13 01:23:16,697 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:23:16,697 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643129066] [2021-08-13 01:23:16,697 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643129066] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:23:16,699 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:23:16,699 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 01:23:16,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332540211] [2021-08-13 01:23:16,700 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 01:23:16,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:23:16,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 01:23:16,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-13 01:23:16,701 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 85 [2021-08-13 01:23:16,701 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 871 transitions, 15634 flow. Second operand has 10 states, 10 states have (on average 66.5) internal successors, (665), 10 states have internal predecessors, (665), 0 states have call successors, (0), 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-13 01:23:16,702 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:23:16,702 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 85 [2021-08-13 01:23:16,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:23:17,810 INFO L129 PetriNetUnfolder]: 1182/5159 cut-off events. [2021-08-13 01:23:17,811 INFO L130 PetriNetUnfolder]: For 13379/17737 co-relation queries the response was YES. [2021-08-13 01:23:17,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27578 conditions, 5159 events. 1182/5159 cut-off events. For 13379/17737 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 61546 event pairs, 0 based on Foata normal form. 27/5170 useless extension candidates. Maximal degree in co-relation 27474. Up to 2029 conditions per place. [2021-08-13 01:23:17,830 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 28 selfloop transitions, 11 changer transitions 899/993 dead transitions. [2021-08-13 01:23:17,830 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 993 transitions, 19898 flow [2021-08-13 01:23:17,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-13 01:23:17,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-08-13 01:23:17,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 833 transitions. [2021-08-13 01:23:17,832 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2021-08-13 01:23:17,832 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 833 transitions. [2021-08-13 01:23:17,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 833 transitions. [2021-08-13 01:23:17,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:23:17,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 833 transitions. [2021-08-13 01:23:17,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 69.41666666666667) internal successors, (833), 12 states have internal predecessors, (833), 0 states have call successors, (0), 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-13 01:23:17,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 85.0) internal successors, (1105), 13 states have internal predecessors, (1105), 0 states have call successors, (0), 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-13 01:23:17,836 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 85.0) internal successors, (1105), 13 states have internal predecessors, (1105), 0 states have call successors, (0), 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-13 01:23:17,836 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 136 predicate places. [2021-08-13 01:23:17,836 INFO L482 AbstractCegarLoop]: Abstraction has has 224 places, 993 transitions, 19898 flow [2021-08-13 01:23:17,837 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 66.5) internal successors, (665), 10 states have internal predecessors, (665), 0 states have call successors, (0), 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-13 01:23:17,837 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:23:17,837 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] [2021-08-13 01:23:17,837 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-13 01:23:17,837 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:23:17,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:23:17,837 INFO L82 PathProgramCache]: Analyzing trace with hash 415372559, now seen corresponding path program 1 times [2021-08-13 01:23:17,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:23:17,838 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742366917] [2021-08-13 01:23:17,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:23:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:23:17,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:17,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:17,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:17,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:23:17,880 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 01:23:17,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 01:23:17,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:17,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:23:17,903 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 01:23:17,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:17,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:17,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:17,912 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-13 01:23:17,912 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:23:17,912 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742366917] [2021-08-13 01:23:17,912 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742366917] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:23:17,912 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:23:17,912 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 01:23:17,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262427222] [2021-08-13 01:23:17,913 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 01:23:17,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:23:17,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 01:23:17,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 01:23:17,914 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-08-13 01:23:17,914 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 993 transitions, 19898 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 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-13 01:23:17,914 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:23:17,914 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-08-13 01:23:17,915 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:23:18,286 INFO L129 PetriNetUnfolder]: 249/1234 cut-off events. [2021-08-13 01:23:18,286 INFO L130 PetriNetUnfolder]: For 2909/3186 co-relation queries the response was YES. [2021-08-13 01:23:18,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5232 conditions, 1234 events. 249/1234 cut-off events. For 2909/3186 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 10495 event pairs, 16 based on Foata normal form. 5/1181 useless extension candidates. Maximal degree in co-relation 5125. Up to 366 conditions per place. [2021-08-13 01:23:18,292 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 13 selfloop transitions, 12 changer transitions 160/268 dead transitions. [2021-08-13 01:23:18,292 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 268 transitions, 4122 flow [2021-08-13 01:23:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 01:23:18,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 01:23:18,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 755 transitions. [2021-08-13 01:23:18,294 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.888235294117647 [2021-08-13 01:23:18,294 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 755 transitions. [2021-08-13 01:23:18,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 755 transitions. [2021-08-13 01:23:18,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:23:18,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 755 transitions. [2021-08-13 01:23:18,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 75.5) internal successors, (755), 10 states have internal predecessors, (755), 0 states have call successors, (0), 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-13 01:23:18,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 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-13 01:23:18,297 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 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-13 01:23:18,297 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 100 predicate places. [2021-08-13 01:23:18,297 INFO L482 AbstractCegarLoop]: Abstraction has has 188 places, 268 transitions, 4122 flow [2021-08-13 01:23:18,298 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 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-13 01:23:18,298 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:23:18,298 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] [2021-08-13 01:23:18,298 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-13 01:23:18,298 INFO L430 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:23:18,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:23:18,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2124817775, now seen corresponding path program 1 times [2021-08-13 01:23:18,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:23:18,299 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631624612] [2021-08-13 01:23:18,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:23:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:23:18,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:18,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:18,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:18,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:23:18,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:18,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:23:18,343 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 01:23:18,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 01:23:18,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:18,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:23:18,367 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 01:23:18,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:23:18,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:23:18,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:23:18,376 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-13 01:23:18,376 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:23:18,376 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631624612] [2021-08-13 01:23:18,376 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631624612] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:23:18,376 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:23:18,377 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 01:23:18,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054937456] [2021-08-13 01:23:18,377 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 01:23:18,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:23:18,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 01:23:18,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 01:23:18,378 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-08-13 01:23:18,378 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 268 transitions, 4122 flow. Second operand has 7 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 0 states have call successors, (0), 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-13 01:23:18,379 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:23:18,379 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-08-13 01:23:18,379 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:23:18,577 INFO L129 PetriNetUnfolder]: 129/588 cut-off events. [2021-08-13 01:23:18,577 INFO L130 PetriNetUnfolder]: For 699/1049 co-relation queries the response was YES. [2021-08-13 01:23:18,578 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1805 conditions, 588 events. 129/588 cut-off events. For 699/1049 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4344 event pairs, 0 based on Foata normal form. 77/625 useless extension candidates. Maximal degree in co-relation 1695. Up to 113 conditions per place. [2021-08-13 01:23:18,579 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 12 selfloop transitions, 15 changer transitions 60/150 dead transitions. [2021-08-13 01:23:18,579 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 150 transitions, 1392 flow [2021-08-13 01:23:18,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 01:23:18,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 01:23:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 972 transitions. [2021-08-13 01:23:18,593 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8796380090497737 [2021-08-13 01:23:18,593 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 972 transitions. [2021-08-13 01:23:18,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 972 transitions. [2021-08-13 01:23:18,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:23:18,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 972 transitions. [2021-08-13 01:23:18,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 74.76923076923077) internal successors, (972), 13 states have internal predecessors, (972), 0 states have call successors, (0), 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-13 01:23:18,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 01:23:18,597 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 01:23:18,597 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 79 predicate places. [2021-08-13 01:23:18,597 INFO L482 AbstractCegarLoop]: Abstraction has has 167 places, 150 transitions, 1392 flow [2021-08-13 01:23:18,598 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 0 states have call successors, (0), 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-13 01:23:18,598 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:23:18,598 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] [2021-08-13 01:23:18,598 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-13 01:23:18,598 INFO L430 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:23:18,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:23:18,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1141080468, now seen corresponding path program 1 times [2021-08-13 01:23:18,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:23:18,598 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298778212] [2021-08-13 01:23:18,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:23:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 01:23:18,625 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 01:23:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 01:23:18,656 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 01:23:18,687 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 01:23:18,687 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 01:23:18,687 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-13 01:23:18,690 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 01:23:18,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 01:23:18 BasicIcfg [2021-08-13 01:23:18,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 01:23:18,790 INFO L168 Benchmark]: Toolchain (without parser) took 14444.31 ms. Allocated memory was 186.6 MB in the beginning and 696.3 MB in the end (delta: 509.6 MB). Free memory was 149.7 MB in the beginning and 440.2 MB in the end (delta: -290.5 MB). Peak memory consumption was 219.8 MB. Max. memory is 8.0 GB. [2021-08-13 01:23:18,790 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 186.6 MB. Free memory was 168.3 MB in the beginning and 168.2 MB in the end (delta: 147.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 01:23:18,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 593.58 ms. Allocated memory is still 186.6 MB. Free memory was 149.4 MB in the beginning and 148.7 MB in the end (delta: 734.9 kB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. [2021-08-13 01:23:18,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.15 ms. Allocated memory is still 186.6 MB. Free memory was 148.7 MB in the beginning and 145.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-13 01:23:18,792 INFO L168 Benchmark]: Boogie Preprocessor took 55.64 ms. Allocated memory is still 186.6 MB. Free memory was 145.7 MB in the beginning and 143.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 01:23:18,792 INFO L168 Benchmark]: RCFGBuilder took 1766.82 ms. Allocated memory was 186.6 MB in the beginning and 253.8 MB in the end (delta: 67.1 MB). Free memory was 143.6 MB in the beginning and 212.9 MB in the end (delta: -69.3 MB). Peak memory consumption was 85.9 MB. Max. memory is 8.0 GB. [2021-08-13 01:23:18,792 INFO L168 Benchmark]: TraceAbstraction took 11943.30 ms. Allocated memory was 253.8 MB in the beginning and 696.3 MB in the end (delta: 442.5 MB). Free memory was 212.3 MB in the beginning and 440.2 MB in the end (delta: -227.8 MB). Peak memory consumption was 215.2 MB. Max. memory is 8.0 GB. [2021-08-13 01:23:18,793 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.14 ms. Allocated memory is still 186.6 MB. Free memory was 168.3 MB in the beginning and 168.2 MB in the end (delta: 147.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 593.58 ms. Allocated memory is still 186.6 MB. Free memory was 149.4 MB in the beginning and 148.7 MB in the end (delta: 734.9 kB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 77.15 ms. Allocated memory is still 186.6 MB. Free memory was 148.7 MB in the beginning and 145.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 55.64 ms. Allocated memory is still 186.6 MB. Free memory was 145.7 MB in the beginning and 143.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1766.82 ms. Allocated memory was 186.6 MB in the beginning and 253.8 MB in the end (delta: 67.1 MB). Free memory was 143.6 MB in the beginning and 212.9 MB in the end (delta: -69.3 MB). Peak memory consumption was 85.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 11943.30 ms. Allocated memory was 253.8 MB in the beginning and 696.3 MB in the end (delta: 442.5 MB). Free memory was 212.3 MB in the beginning and 440.2 MB in the end (delta: -227.8 MB). Peak memory consumption was 215.2 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: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L713] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L714] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L715] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L716] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L717] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L718] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=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_buff1_thd0=0] [L719] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0] [L720] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L721] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L722] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L723] 0 int x$w_buff0; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L724] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L725] 0 int x$w_buff1; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L726] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L728] 0 int y = 0; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L790] 0 pthread_t t2475; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L792] 0 pthread_t t2476; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L765] 2 y = 1 VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L734] 1 y = 2 VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L740] 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) [L740] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L740] 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) [L740] 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) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 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 [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 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 [L768] 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) [L768] 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) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 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 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 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 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L799] 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) [L799] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L799] 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) [L799] 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) [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 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 [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L803] 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 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 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) [L810] 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) [L811] 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)) [L811] EXPR 0 !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) [L811] 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)) [L811] 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)) [L812] 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)) [L812] EXPR 0 !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) [L812] 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)) [L812] 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)) [L813] 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)) [L813] EXPR 0 !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) [L813] 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)) [L813] 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)) [L814] 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)) [L814] EXPR 0 !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) [L814] 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)) [L814] 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)) [L815] 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)) [L815] EXPR 0 !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) [L815] 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)) [L815] 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)) [L816] 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)) [L816] EXPR 0 !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) [L816] 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 11.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 11741.8ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 8893.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 45.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 180 SDtfs, 681 SDslu, 661 SDs, 0 SdLazy, 1206 SolverSat, 285 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1269.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 212 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 2577.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=19898occurred in iteration=11, InterpolantAutomatonStates: 172, 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: 48.4ms SsaConstructionTime, 480.9ms SatisfiabilityAnalysisTime, 2006.3ms InterpolantComputationTime, 833 NumberOfCodeBlocks, 833 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 754 ConstructedInterpolants, 0 QuantifiedInterpolants, 4636 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...