/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/safe031_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 01:28:02,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 01:28:02,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 01:28:02,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 01:28:02,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 01:28:02,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 01:28:02,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 01:28:02,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 01:28:02,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 01:28:02,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 01:28:02,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 01:28:02,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 01:28:02,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 01:28:02,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 01:28:02,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 01:28:02,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 01:28:02,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 01:28:02,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 01:28:02,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 01:28:02,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 01:28:02,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 01:28:02,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 01:28:02,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 01:28:02,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 01:28:02,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 01:28:02,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 01:28:02,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 01:28:02,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 01:28:02,251 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 01:28:02,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 01:28:02,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 01:28:02,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 01:28:02,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 01:28:02,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 01:28:02,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 01:28:02,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 01:28:02,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 01:28:02,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 01:28:02,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 01:28:02,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 01:28:02,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 01:28:02,260 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:28:02,296 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 01:28:02,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 01:28:02,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 01:28:02,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 01:28:02,300 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 01:28:02,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 01:28:02,300 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 01:28:02,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 01:28:02,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 01:28:02,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 01:28:02,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 01:28:02,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 01:28:02,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 01:28:02,302 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 01:28:02,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 01:28:02,303 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 01:28:02,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 01:28:02,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 01:28:02,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 01:28:02,303 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 01:28:02,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 01:28:02,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 01:28:02,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 01:28:02,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 01:28:02,304 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 01:28:02,304 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 01:28:02,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 01:28:02,305 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 01:28:02,305 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 01:28:02,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 01:28:02,305 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 01:28:02,305 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:28:02,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 01:28:02,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 01:28:02,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 01:28:02,653 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-13 01:28:02,653 INFO L275 PluginConnector]: CDTParser initialized [2021-08-13 01:28:02,654 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2021-08-13 01:28:02,710 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f5ff26c/a2fb6ab5de234c9cb06d6e3b9caf4d5c/FLAG936634863 [2021-08-13 01:28:03,171 INFO L306 CDTParser]: Found 1 translation units. [2021-08-13 01:28:03,172 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2021-08-13 01:28:03,183 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f5ff26c/a2fb6ab5de234c9cb06d6e3b9caf4d5c/FLAG936634863 [2021-08-13 01:28:03,195 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f5ff26c/a2fb6ab5de234c9cb06d6e3b9caf4d5c [2021-08-13 01:28:03,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 01:28:03,199 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-13 01:28:03,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-13 01:28:03,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-13 01:28:03,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-13 01:28:03,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 01:28:03" (1/1) ... [2021-08-13 01:28:03,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fd7d90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:28:03, skipping insertion in model container [2021-08-13 01:28:03,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 01:28:03" (1/1) ... [2021-08-13 01:28:03,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-13 01:28:03,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-13 01:28:03,416 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/safe031_power.opt.i[951,964] [2021-08-13 01:28:03,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 01:28:03,680 INFO L203 MainTranslator]: Completed pre-run [2021-08-13 01:28:03,691 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/safe031_power.opt.i[951,964] [2021-08-13 01:28:03,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 01:28:03,810 INFO L208 MainTranslator]: Completed translation [2021-08-13 01:28:03,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:28:03 WrapperNode [2021-08-13 01:28:03,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-13 01:28:03,812 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 01:28:03,812 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 01:28:03,812 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 01:28:03,818 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:28:03" (1/1) ... [2021-08-13 01:28:03,832 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:28:03" (1/1) ... [2021-08-13 01:28:03,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 01:28:03,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 01:28:03,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 01:28:03,859 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 01:28:03,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:28:03" (1/1) ... [2021-08-13 01:28:03,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:28:03" (1/1) ... [2021-08-13 01:28:03,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:28:03" (1/1) ... [2021-08-13 01:28:03,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:28:03" (1/1) ... [2021-08-13 01:28:03,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:28:03" (1/1) ... [2021-08-13 01:28:03,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:28:03" (1/1) ... [2021-08-13 01:28:03,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:28:03" (1/1) ... [2021-08-13 01:28:03,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 01:28:03,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 01:28:03,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 01:28:03,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 01:28:03,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:28:03" (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:28:03,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-13 01:28:03,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-13 01:28:03,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-13 01:28:03,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-13 01:28:03,957 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-13 01:28:03,959 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-13 01:28:03,959 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-13 01:28:03,959 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-13 01:28:03,960 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-13 01:28:03,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-13 01:28:03,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-13 01:28:03,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-13 01:28:03,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 01:28:03,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 01:28:03,962 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:28:05,641 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 01:28:05,642 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-13 01:28:05,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 01:28:05 BoogieIcfgContainer [2021-08-13 01:28:05,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 01:28:05,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 01:28:05,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 01:28:05,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 01:28:05,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 01:28:03" (1/3) ... [2021-08-13 01:28:05,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220d7d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 01:28:05, skipping insertion in model container [2021-08-13 01:28:05,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:28:03" (2/3) ... [2021-08-13 01:28:05,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220d7d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 01:28:05, skipping insertion in model container [2021-08-13 01:28:05,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 01:28:05" (3/3) ... [2021-08-13 01:28:05,651 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_power.opt.i [2021-08-13 01:28:05,659 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 01:28:05,660 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 01:28:05,661 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 01:28:05,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,697 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,697 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,697 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,697 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,697 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,697 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,697 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,699 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,699 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,700 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,700 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,705 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,706 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,706 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,706 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,706 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,706 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,707 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,707 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,707 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,707 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,707 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,707 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,707 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,707 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,711 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,712 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,713 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,713 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,716 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,716 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,718 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,718 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:28:05,725 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-13 01:28:05,746 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-13 01:28:05,775 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 01:28:05,775 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 01:28:05,776 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 01:28:05,776 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 01:28:05,776 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 01:28:05,776 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 01:28:05,776 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 01:28:05,776 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 01:28:05,788 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2021-08-13 01:28:05,831 INFO L129 PetriNetUnfolder]: 2/102 cut-off events. [2021-08-13 01:28:05,832 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 01:28:05,835 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2021-08-13 01:28:05,835 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2021-08-13 01:28:05,840 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2021-08-13 01:28:05,858 INFO L129 PetriNetUnfolder]: 0/68 cut-off events. [2021-08-13 01:28:05,858 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 01:28:05,858 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:28:05,859 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] [2021-08-13 01:28:05,859 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:28:05,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:28:05,864 INFO L82 PathProgramCache]: Analyzing trace with hash -575217819, now seen corresponding path program 1 times [2021-08-13 01:28:05,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:28:05,871 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065387488] [2021-08-13 01:28:05,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:28:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:28:06,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:06,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:06,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:06,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:28:06,121 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:28:06,121 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:28:06,121 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065387488] [2021-08-13 01:28:06,123 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065387488] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:28:06,123 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:28:06,123 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 01:28:06,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253981319] [2021-08-13 01:28:06,131 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 01:28:06,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:28:06,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 01:28:06,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 01:28:06,146 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 105 [2021-08-13 01:28:06,151 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 01:28:06,152 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:28:06,152 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 105 [2021-08-13 01:28:06,153 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:28:06,273 INFO L129 PetriNetUnfolder]: 16/214 cut-off events. [2021-08-13 01:28:06,273 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 01:28:06,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 214 events. 16/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 653 event pairs, 6 based on Foata normal form. 9/212 useless extension candidates. Maximal degree in co-relation 212. Up to 27 conditions per place. [2021-08-13 01:28:06,277 INFO L132 encePairwiseOnDemand]: 100/105 looper letters, 7 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2021-08-13 01:28:06,277 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 101 transitions, 229 flow [2021-08-13 01:28:06,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 01:28:06,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 01:28:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2021-08-13 01:28:06,298 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9492063492063492 [2021-08-13 01:28:06,299 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2021-08-13 01:28:06,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2021-08-13 01:28:06,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:28:06,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2021-08-13 01:28:06,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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:28:06,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 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:28:06,315 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 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:28:06,316 INFO L348 CegarLoopForPetriNet]: 110 programPoint places, 0 predicate places. [2021-08-13 01:28:06,316 INFO L482 AbstractCegarLoop]: Abstraction has has 110 places, 101 transitions, 229 flow [2021-08-13 01:28:06,317 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 01:28:06,317 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:28:06,317 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 01:28:06,317 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 01:28:06,317 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:28:06,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:28:06,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1295563138, now seen corresponding path program 1 times [2021-08-13 01:28:06,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:28:06,319 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887535122] [2021-08-13 01:28:06,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:28:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:28:06,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:06,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:06,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:06,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:28:06,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:06,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:28:06,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:06,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 01:28:06,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:06,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 01:28:06,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:06,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 01:28:06,526 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:28:06,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:28:06,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:06,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:28:06,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:06,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:28:06,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:06,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:06,566 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:28:06,566 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:28:06,567 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887535122] [2021-08-13 01:28:06,567 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887535122] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:28:06,567 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:28:06,567 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 01:28:06,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256375082] [2021-08-13 01:28:06,568 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 01:28:06,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:28:06,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 01:28:06,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-13 01:28:06,571 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 105 [2021-08-13 01:28:06,572 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 101 transitions, 229 flow. Second operand has 10 states, 10 states have (on average 86.1) internal successors, (861), 10 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 01:28:06,572 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:28:06,572 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 105 [2021-08-13 01:28:06,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:28:06,908 INFO L129 PetriNetUnfolder]: 130/518 cut-off events. [2021-08-13 01:28:06,908 INFO L130 PetriNetUnfolder]: For 95/146 co-relation queries the response was YES. [2021-08-13 01:28:06,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 518 events. 130/518 cut-off events. For 95/146 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2792 event pairs, 21 based on Foata normal form. 2/506 useless extension candidates. Maximal degree in co-relation 855. Up to 143 conditions per place. [2021-08-13 01:28:06,913 INFO L132 encePairwiseOnDemand]: 93/105 looper letters, 15 selfloop transitions, 10 changer transitions 50/148 dead transitions. [2021-08-13 01:28:06,913 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 148 transitions, 503 flow [2021-08-13 01:28:06,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-13 01:28:06,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-08-13 01:28:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1338 transitions. [2021-08-13 01:28:06,916 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8495238095238096 [2021-08-13 01:28:06,917 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1338 transitions. [2021-08-13 01:28:06,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1338 transitions. [2021-08-13 01:28:06,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:28:06,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1338 transitions. [2021-08-13 01:28:06,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 89.2) internal successors, (1338), 15 states have internal predecessors, (1338), 0 states have call successors, (0), 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:28:06,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 105.0) internal successors, (1680), 16 states have internal predecessors, (1680), 0 states have call successors, (0), 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:28:06,925 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 105.0) internal successors, (1680), 16 states have internal predecessors, (1680), 0 states have call successors, (0), 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:28:06,926 INFO L348 CegarLoopForPetriNet]: 110 programPoint places, 14 predicate places. [2021-08-13 01:28:06,926 INFO L482 AbstractCegarLoop]: Abstraction has has 124 places, 148 transitions, 503 flow [2021-08-13 01:28:06,927 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 86.1) internal successors, (861), 10 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 01:28:06,927 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:28:06,927 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 01:28:06,927 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 01:28:06,927 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:28:06,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:28:06,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1354473828, now seen corresponding path program 1 times [2021-08-13 01:28:06,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:28:06,928 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978767544] [2021-08-13 01:28:06,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:28:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:28:07,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:07,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:07,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:07,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:28:07,041 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:28:07,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:28:07,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:07,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:28:07,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:07,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:28:07,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:07,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:07,079 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:28:07,079 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:28:07,079 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978767544] [2021-08-13 01:28:07,080 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978767544] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:28:07,080 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:28:07,080 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 01:28:07,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992165044] [2021-08-13 01:28:07,080 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 01:28:07,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:28:07,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 01:28:07,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 01:28:07,084 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 105 [2021-08-13 01:28:07,085 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 148 transitions, 503 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 01:28:07,085 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:28:07,085 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 105 [2021-08-13 01:28:07,086 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:28:07,536 INFO L129 PetriNetUnfolder]: 635/1955 cut-off events. [2021-08-13 01:28:07,537 INFO L130 PetriNetUnfolder]: For 396/454 co-relation queries the response was YES. [2021-08-13 01:28:07,544 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 1955 events. 635/1955 cut-off events. For 396/454 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 15956 event pairs, 96 based on Foata normal form. 0/1920 useless extension candidates. Maximal degree in co-relation 3695. Up to 472 conditions per place. [2021-08-13 01:28:07,548 INFO L132 encePairwiseOnDemand]: 98/105 looper letters, 10 selfloop transitions, 3 changer transitions 98/198 dead transitions. [2021-08-13 01:28:07,548 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 198 transitions, 833 flow [2021-08-13 01:28:07,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 01:28:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 01:28:07,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 863 transitions. [2021-08-13 01:28:07,550 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9132275132275133 [2021-08-13 01:28:07,551 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 863 transitions. [2021-08-13 01:28:07,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 863 transitions. [2021-08-13 01:28:07,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:28:07,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 863 transitions. [2021-08-13 01:28:07,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.88888888888889) internal successors, (863), 9 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 01:28:07,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 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:28:07,555 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 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:28:07,556 INFO L348 CegarLoopForPetriNet]: 110 programPoint places, 22 predicate places. [2021-08-13 01:28:07,556 INFO L482 AbstractCegarLoop]: Abstraction has has 132 places, 198 transitions, 833 flow [2021-08-13 01:28:07,556 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 01:28:07,556 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:28:07,556 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 01:28:07,556 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 01:28:07,557 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:28:07,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:28:07,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1693349634, now seen corresponding path program 1 times [2021-08-13 01:28:07,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:28:07,557 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126105466] [2021-08-13 01:28:07,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:28:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:28:07,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:07,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:07,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:07,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:28:07,654 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:28:07,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:28:07,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:07,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:28:07,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:07,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:28:07,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:07,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:07,694 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:28:07,694 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:28:07,694 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126105466] [2021-08-13 01:28:07,694 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126105466] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:28:07,694 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:28:07,694 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 01:28:07,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911635306] [2021-08-13 01:28:07,695 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 01:28:07,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:28:07,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 01:28:07,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 01:28:07,698 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 105 [2021-08-13 01:28:07,699 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 198 transitions, 833 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 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:28:07,699 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:28:07,699 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 105 [2021-08-13 01:28:07,699 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:28:08,176 INFO L129 PetriNetUnfolder]: 744/2534 cut-off events. [2021-08-13 01:28:08,176 INFO L130 PetriNetUnfolder]: For 762/926 co-relation queries the response was YES. [2021-08-13 01:28:08,186 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5531 conditions, 2534 events. 744/2534 cut-off events. For 762/926 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 23249 event pairs, 94 based on Foata normal form. 3/2499 useless extension candidates. Maximal degree in co-relation 5472. Up to 689 conditions per place. [2021-08-13 01:28:08,191 INFO L132 encePairwiseOnDemand]: 99/105 looper letters, 14 selfloop transitions, 3 changer transitions 132/236 dead transitions. [2021-08-13 01:28:08,191 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 236 transitions, 1285 flow [2021-08-13 01:28:08,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 01:28:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 01:28:08,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 858 transitions. [2021-08-13 01:28:08,193 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9079365079365079 [2021-08-13 01:28:08,193 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 858 transitions. [2021-08-13 01:28:08,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 858 transitions. [2021-08-13 01:28:08,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:28:08,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 858 transitions. [2021-08-13 01:28:08,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.33333333333333) internal successors, (858), 9 states have internal predecessors, (858), 0 states have call successors, (0), 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:28:08,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 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:28:08,197 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 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:28:08,197 INFO L348 CegarLoopForPetriNet]: 110 programPoint places, 30 predicate places. [2021-08-13 01:28:08,197 INFO L482 AbstractCegarLoop]: Abstraction has has 140 places, 236 transitions, 1285 flow [2021-08-13 01:28:08,198 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 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:28:08,198 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:28:08,198 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 01:28:08,198 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 01:28:08,198 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:28:08,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:28:08,199 INFO L82 PathProgramCache]: Analyzing trace with hash -399590043, now seen corresponding path program 1 times [2021-08-13 01:28:08,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:28:08,199 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483069202] [2021-08-13 01:28:08,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:28:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:28:08,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:08,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:08,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:08,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:28:08,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:08,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:28:08,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:08,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 01:28:08,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:08,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 01:28:08,305 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-08-13 01:28:08,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-13 01:28:08,314 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-08-13 01:28:08,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-13 01:28:08,337 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:28:08,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:28:08,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:08,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:28:08,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:08,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:28:08,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:08,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:08,377 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:28:08,378 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:28:08,378 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483069202] [2021-08-13 01:28:08,378 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483069202] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:28:08,378 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:28:08,378 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 01:28:08,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318410277] [2021-08-13 01:28:08,379 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 01:28:08,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:28:08,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 01:28:08,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-13 01:28:08,381 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 105 [2021-08-13 01:28:08,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 236 transitions, 1285 flow. Second operand has 10 states, 10 states have (on average 86.2) internal successors, (862), 10 states have internal predecessors, (862), 0 states have call successors, (0), 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:28:08,383 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:28:08,383 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 105 [2021-08-13 01:28:08,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:28:09,231 INFO L129 PetriNetUnfolder]: 959/3402 cut-off events. [2021-08-13 01:28:09,232 INFO L130 PetriNetUnfolder]: For 1377/1749 co-relation queries the response was YES. [2021-08-13 01:28:09,248 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8778 conditions, 3402 events. 959/3402 cut-off events. For 1377/1749 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 33881 event pairs, 118 based on Foata normal form. 14/3377 useless extension candidates. Maximal degree in co-relation 8713. Up to 1026 conditions per place. [2021-08-13 01:28:09,254 INFO L132 encePairwiseOnDemand]: 94/105 looper letters, 20 selfloop transitions, 10 changer transitions 207/312 dead transitions. [2021-08-13 01:28:09,254 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 312 transitions, 2277 flow [2021-08-13 01:28:09,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 01:28:09,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 01:28:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1422 transitions. [2021-08-13 01:28:09,258 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8464285714285714 [2021-08-13 01:28:09,258 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1422 transitions. [2021-08-13 01:28:09,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1422 transitions. [2021-08-13 01:28:09,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:28:09,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1422 transitions. [2021-08-13 01:28:09,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 88.875) internal successors, (1422), 16 states have internal predecessors, (1422), 0 states have call successors, (0), 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:28:09,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 105.0) internal successors, (1785), 17 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:28:09,265 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 105.0) internal successors, (1785), 17 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:28:09,265 INFO L348 CegarLoopForPetriNet]: 110 programPoint places, 45 predicate places. [2021-08-13 01:28:09,265 INFO L482 AbstractCegarLoop]: Abstraction has has 155 places, 312 transitions, 2277 flow [2021-08-13 01:28:09,266 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 86.2) internal successors, (862), 10 states have internal predecessors, (862), 0 states have call successors, (0), 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:28:09,266 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:28:09,266 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 01:28:09,266 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 01:28:09,266 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:28:09,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:28:09,267 INFO L82 PathProgramCache]: Analyzing trace with hash -975419796, now seen corresponding path program 1 times [2021-08-13 01:28:09,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:28:09,267 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428782894] [2021-08-13 01:28:09,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:28:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:28:09,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:09,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:09,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:09,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:28:09,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:09,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:28:09,480 INFO L142 QuantifierPusher]: treesize reduction 20, result has 78.9 percent of original size [2021-08-13 01:28:09,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 75 [2021-08-13 01:28:09,492 INFO L142 QuantifierPusher]: treesize reduction 20, result has 79.6 percent of original size [2021-08-13 01:28:09,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2021-08-13 01:28:09,514 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:28:09,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:28:09,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:09,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:28:09,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:09,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:28:09,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:09,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:09,551 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:28:09,551 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:28:09,551 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428782894] [2021-08-13 01:28:09,551 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428782894] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:28:09,551 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:28:09,552 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 01:28:09,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510202969] [2021-08-13 01:28:09,552 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 01:28:09,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:28:09,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 01:28:09,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-13 01:28:09,555 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 105 [2021-08-13 01:28:09,556 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 312 transitions, 2277 flow. Second operand has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 01:28:09,556 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:28:09,556 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 105 [2021-08-13 01:28:09,556 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:28:10,371 INFO L129 PetriNetUnfolder]: 1097/3852 cut-off events. [2021-08-13 01:28:10,371 INFO L130 PetriNetUnfolder]: For 2022/2497 co-relation queries the response was YES. [2021-08-13 01:28:10,386 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11660 conditions, 3852 events. 1097/3852 cut-off events. For 2022/2497 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 39274 event pairs, 73 based on Foata normal form. 9/3825 useless extension candidates. Maximal degree in co-relation 11590. Up to 1286 conditions per place. [2021-08-13 01:28:10,392 INFO L132 encePairwiseOnDemand]: 96/105 looper letters, 28 selfloop transitions, 7 changer transitions 304/415 dead transitions. [2021-08-13 01:28:10,393 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 415 transitions, 3901 flow [2021-08-13 01:28:10,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-13 01:28:10,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-08-13 01:28:10,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1265 transitions. [2021-08-13 01:28:10,396 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8605442176870748 [2021-08-13 01:28:10,396 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1265 transitions. [2021-08-13 01:28:10,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1265 transitions. [2021-08-13 01:28:10,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:28:10,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1265 transitions. [2021-08-13 01:28:10,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 90.35714285714286) internal successors, (1265), 14 states have internal predecessors, (1265), 0 states have call successors, (0), 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:28:10,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 105.0) internal successors, (1575), 15 states have internal predecessors, (1575), 0 states have call successors, (0), 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:28:10,402 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 105.0) internal successors, (1575), 15 states have internal predecessors, (1575), 0 states have call successors, (0), 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:28:10,402 INFO L348 CegarLoopForPetriNet]: 110 programPoint places, 58 predicate places. [2021-08-13 01:28:10,402 INFO L482 AbstractCegarLoop]: Abstraction has has 168 places, 415 transitions, 3901 flow [2021-08-13 01:28:10,403 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 01:28:10,403 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:28:10,403 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 01:28:10,403 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 01:28:10,403 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:28:10,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:28:10,404 INFO L82 PathProgramCache]: Analyzing trace with hash -490852991, now seen corresponding path program 1 times [2021-08-13 01:28:10,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:28:10,404 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937135942] [2021-08-13 01:28:10,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:28:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:28:10,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:10,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:10,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:10,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:28:10,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:10,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:28:10,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:10,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 01:28:10,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:10,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 01:28:10,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:10,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:28:10,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:10,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-08-13 01:28:10,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:10,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 01:28:10,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:10,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-08-13 01:28:10,597 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:28:10,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:28:10,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:10,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:28:10,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:10,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:28:10,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:10,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:10,641 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:28:10,641 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:28:10,641 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937135942] [2021-08-13 01:28:10,641 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937135942] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:28:10,642 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:28:10,642 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-13 01:28:10,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919856793] [2021-08-13 01:28:10,642 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-08-13 01:28:10,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:28:10,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-13 01:28:10,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-08-13 01:28:10,644 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2021-08-13 01:28:10,645 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 415 transitions, 3901 flow. Second operand has 13 states, 13 states have (on average 84.15384615384616) internal successors, (1094), 13 states have internal predecessors, (1094), 0 states have call successors, (0), 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:28:10,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:28:10,645 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2021-08-13 01:28:10,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:28:11,725 INFO L129 PetriNetUnfolder]: 1193/4265 cut-off events. [2021-08-13 01:28:11,725 INFO L130 PetriNetUnfolder]: For 2743/3297 co-relation queries the response was YES. [2021-08-13 01:28:11,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14638 conditions, 4265 events. 1193/4265 cut-off events. For 2743/3297 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 44757 event pairs, 77 based on Foata normal form. 13/4238 useless extension candidates. Maximal degree in co-relation 14560. Up to 1380 conditions per place. [2021-08-13 01:28:11,755 INFO L132 encePairwiseOnDemand]: 93/105 looper letters, 23 selfloop transitions, 13 changer transitions 386/495 dead transitions. [2021-08-13 01:28:11,756 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 495 transitions, 5623 flow [2021-08-13 01:28:11,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-13 01:28:11,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-08-13 01:28:11,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1563 transitions. [2021-08-13 01:28:11,760 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8269841269841269 [2021-08-13 01:28:11,760 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1563 transitions. [2021-08-13 01:28:11,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1563 transitions. [2021-08-13 01:28:11,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:28:11,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1563 transitions. [2021-08-13 01:28:11,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 86.83333333333333) internal successors, (1563), 18 states have internal predecessors, (1563), 0 states have call successors, (0), 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:28:11,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 105.0) internal successors, (1995), 19 states have internal predecessors, (1995), 0 states have call successors, (0), 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:28:11,767 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 105.0) internal successors, (1995), 19 states have internal predecessors, (1995), 0 states have call successors, (0), 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:28:11,767 INFO L348 CegarLoopForPetriNet]: 110 programPoint places, 75 predicate places. [2021-08-13 01:28:11,767 INFO L482 AbstractCegarLoop]: Abstraction has has 185 places, 495 transitions, 5623 flow [2021-08-13 01:28:11,768 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 84.15384615384616) internal successors, (1094), 13 states have internal predecessors, (1094), 0 states have call successors, (0), 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:28:11,768 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:28:11,768 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 01:28:11,768 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-13 01:28:11,768 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:28:11,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:28:11,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1112072272, now seen corresponding path program 1 times [2021-08-13 01:28:11,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:28:11,769 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832116995] [2021-08-13 01:28:11,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:28:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:28:11,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:11,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:11,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:11,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:28:11,872 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 01:28:11,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 01:28:11,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:11,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:28:11,896 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 01:28:11,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:28:11,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:11,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:11,907 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:28:11,907 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:28:11,907 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832116995] [2021-08-13 01:28:11,908 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832116995] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:28:11,908 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:28:11,908 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 01:28:11,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440773628] [2021-08-13 01:28:11,908 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 01:28:11,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:28:11,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 01:28:11,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 01:28:11,910 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 105 [2021-08-13 01:28:11,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 495 transitions, 5623 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 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:28:11,911 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:28:11,911 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 105 [2021-08-13 01:28:11,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:28:12,651 INFO L129 PetriNetUnfolder]: 987/3636 cut-off events. [2021-08-13 01:28:12,651 INFO L130 PetriNetUnfolder]: For 2548/2918 co-relation queries the response was YES. [2021-08-13 01:28:12,670 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11343 conditions, 3636 events. 987/3636 cut-off events. For 2548/2918 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 37206 event pairs, 106 based on Foata normal form. 0/3480 useless extension candidates. Maximal degree in co-relation 11262. Up to 1081 conditions per place. [2021-08-13 01:28:12,683 INFO L132 encePairwiseOnDemand]: 95/105 looper letters, 21 selfloop transitions, 15 changer transitions 203/387 dead transitions. [2021-08-13 01:28:12,683 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 387 transitions, 3821 flow [2021-08-13 01:28:12,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 01:28:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 01:28:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 953 transitions. [2021-08-13 01:28:12,686 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9076190476190477 [2021-08-13 01:28:12,686 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 953 transitions. [2021-08-13 01:28:12,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 953 transitions. [2021-08-13 01:28:12,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:28:12,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 953 transitions. [2021-08-13 01:28:12,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.3) internal successors, (953), 10 states have internal predecessors, (953), 0 states have call successors, (0), 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:28:12,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 105.0) internal successors, (1155), 11 states have internal predecessors, (1155), 0 states have call successors, (0), 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:28:12,691 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 105.0) internal successors, (1155), 11 states have internal predecessors, (1155), 0 states have call successors, (0), 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:28:12,691 INFO L348 CegarLoopForPetriNet]: 110 programPoint places, 84 predicate places. [2021-08-13 01:28:12,691 INFO L482 AbstractCegarLoop]: Abstraction has has 194 places, 387 transitions, 3821 flow [2021-08-13 01:28:12,692 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 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:28:12,692 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:28:12,692 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 01:28:12,692 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-13 01:28:12,692 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:28:12,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:28:12,693 INFO L82 PathProgramCache]: Analyzing trace with hash 578088702, now seen corresponding path program 1 times [2021-08-13 01:28:12,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:28:12,693 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236553820] [2021-08-13 01:28:12,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:28:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:28:12,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:12,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:12,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:12,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:28:12,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:12,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:28:12,756 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 01:28:12,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 01:28:12,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:12,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:28:12,782 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 01:28:12,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:28:12,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:12,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:12,792 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:28:12,792 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:28:12,792 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236553820] [2021-08-13 01:28:12,792 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236553820] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:28:12,792 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:28:12,793 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 01:28:12,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047529598] [2021-08-13 01:28:12,793 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 01:28:12,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:28:12,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 01:28:12,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 01:28:12,794 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 105 [2021-08-13 01:28:12,795 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 387 transitions, 3821 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 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:28:12,795 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:28:12,795 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 105 [2021-08-13 01:28:12,795 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:28:13,117 INFO L129 PetriNetUnfolder]: 404/1324 cut-off events. [2021-08-13 01:28:13,118 INFO L130 PetriNetUnfolder]: For 695/1639 co-relation queries the response was YES. [2021-08-13 01:28:13,123 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3931 conditions, 1324 events. 404/1324 cut-off events. For 695/1639 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 10168 event pairs, 13 based on Foata normal form. 135/1375 useless extension candidates. Maximal degree in co-relation 3847. Up to 291 conditions per place. [2021-08-13 01:28:13,128 INFO L132 encePairwiseOnDemand]: 95/105 looper letters, 22 selfloop transitions, 36 changer transitions 61/220 dead transitions. [2021-08-13 01:28:13,128 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 220 transitions, 1463 flow [2021-08-13 01:28:13,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 01:28:13,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 01:28:13,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1240 transitions. [2021-08-13 01:28:13,131 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9084249084249084 [2021-08-13 01:28:13,131 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1240 transitions. [2021-08-13 01:28:13,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1240 transitions. [2021-08-13 01:28:13,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:28:13,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1240 transitions. [2021-08-13 01:28:13,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.38461538461539) internal successors, (1240), 13 states have internal predecessors, (1240), 0 states have call successors, (0), 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:28:13,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 105.0) internal successors, (1470), 14 states have internal predecessors, (1470), 0 states have call successors, (0), 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:28:13,137 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 105.0) internal successors, (1470), 14 states have internal predecessors, (1470), 0 states have call successors, (0), 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:28:13,137 INFO L348 CegarLoopForPetriNet]: 110 programPoint places, 60 predicate places. [2021-08-13 01:28:13,137 INFO L482 AbstractCegarLoop]: Abstraction has has 170 places, 220 transitions, 1463 flow [2021-08-13 01:28:13,137 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 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:28:13,138 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:28:13,138 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 01:28:13,138 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-13 01:28:13,138 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:28:13,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:28:13,138 INFO L82 PathProgramCache]: Analyzing trace with hash 791448093, now seen corresponding path program 1 times [2021-08-13 01:28:13,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:28:13,139 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592973533] [2021-08-13 01:28:13,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:28:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:28:13,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:13,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:13,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:13,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:28:13,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:13,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:28:13,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:13,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:28:13,204 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 01:28:13,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 01:28:13,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:13,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:28:13,229 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 01:28:13,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:28:13,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:13,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:13,240 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:28:13,240 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:28:13,240 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592973533] [2021-08-13 01:28:13,240 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592973533] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:28:13,240 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:28:13,240 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 01:28:13,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528273748] [2021-08-13 01:28:13,241 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 01:28:13,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:28:13,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 01:28:13,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-13 01:28:13,242 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 105 [2021-08-13 01:28:13,243 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 220 transitions, 1463 flow. Second operand has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 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:28:13,243 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:28:13,243 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 105 [2021-08-13 01:28:13,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:28:13,575 INFO L129 PetriNetUnfolder]: 328/950 cut-off events. [2021-08-13 01:28:13,575 INFO L130 PetriNetUnfolder]: For 452/2076 co-relation queries the response was YES. [2021-08-13 01:28:13,579 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3137 conditions, 950 events. 328/950 cut-off events. For 452/2076 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 7175 event pairs, 0 based on Foata normal form. 176/1063 useless extension candidates. Maximal degree in co-relation 3050. Up to 265 conditions per place. [2021-08-13 01:28:13,583 INFO L132 encePairwiseOnDemand]: 95/105 looper letters, 19 selfloop transitions, 40 changer transitions 66/210 dead transitions. [2021-08-13 01:28:13,583 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 210 transitions, 1397 flow [2021-08-13 01:28:13,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 01:28:13,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 01:28:13,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1512 transitions. [2021-08-13 01:28:13,585 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9 [2021-08-13 01:28:13,585 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1512 transitions. [2021-08-13 01:28:13,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1512 transitions. [2021-08-13 01:28:13,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:28:13,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1512 transitions. [2021-08-13 01:28:13,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 94.5) internal successors, (1512), 16 states have internal predecessors, (1512), 0 states have call successors, (0), 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:28:13,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 105.0) internal successors, (1785), 17 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:28:13,591 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 105.0) internal successors, (1785), 17 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:28:13,591 INFO L348 CegarLoopForPetriNet]: 110 programPoint places, 65 predicate places. [2021-08-13 01:28:13,591 INFO L482 AbstractCegarLoop]: Abstraction has has 175 places, 210 transitions, 1397 flow [2021-08-13 01:28:13,592 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 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:28:13,592 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:28:13,592 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 01:28:13,592 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-13 01:28:13,592 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:28:13,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:28:13,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1255950231, now seen corresponding path program 1 times [2021-08-13 01:28:13,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:28:13,593 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096466297] [2021-08-13 01:28:13,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:28:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:28:13,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:13,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:13,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:13,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:28:13,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:13,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:28:13,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:13,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 01:28:13,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:13,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 01:28:13,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:13,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-08-13 01:28:13,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:13,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-08-13 01:28:13,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:13,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-08-13 01:28:13,746 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:28:13,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:28:13,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:13,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:28:13,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:13,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:28:13,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:13,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:13,789 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:28:13,789 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:28:13,789 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096466297] [2021-08-13 01:28:13,789 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096466297] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:28:13,790 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:28:13,790 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-13 01:28:13,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554583093] [2021-08-13 01:28:13,790 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-13 01:28:13,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:28:13,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-13 01:28:13,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-08-13 01:28:13,791 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2021-08-13 01:28:13,792 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 210 transitions, 1397 flow. Second operand has 12 states, 12 states have (on average 82.58333333333333) internal successors, (991), 12 states have internal predecessors, (991), 0 states have call successors, (0), 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:28:13,792 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:28:13,792 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2021-08-13 01:28:13,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:28:14,177 INFO L129 PetriNetUnfolder]: 754/2251 cut-off events. [2021-08-13 01:28:14,178 INFO L130 PetriNetUnfolder]: For 1491/2953 co-relation queries the response was YES. [2021-08-13 01:28:14,194 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7374 conditions, 2251 events. 754/2251 cut-off events. For 1491/2953 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 21851 event pairs, 1 based on Foata normal form. 12/2089 useless extension candidates. Maximal degree in co-relation 7279. Up to 591 conditions per place. [2021-08-13 01:28:14,198 INFO L132 encePairwiseOnDemand]: 94/105 looper letters, 17 selfloop transitions, 5 changer transitions 97/238 dead transitions. [2021-08-13 01:28:14,198 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 238 transitions, 1819 flow [2021-08-13 01:28:14,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-13 01:28:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-08-13 01:28:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1178 transitions. [2021-08-13 01:28:14,200 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8013605442176871 [2021-08-13 01:28:14,200 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1178 transitions. [2021-08-13 01:28:14,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1178 transitions. [2021-08-13 01:28:14,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:28:14,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1178 transitions. [2021-08-13 01:28:14,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 84.14285714285714) internal successors, (1178), 14 states have internal predecessors, (1178), 0 states have call successors, (0), 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:28:14,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 105.0) internal successors, (1575), 15 states have internal predecessors, (1575), 0 states have call successors, (0), 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:28:14,207 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 105.0) internal successors, (1575), 15 states have internal predecessors, (1575), 0 states have call successors, (0), 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:28:14,207 INFO L348 CegarLoopForPetriNet]: 110 programPoint places, 78 predicate places. [2021-08-13 01:28:14,207 INFO L482 AbstractCegarLoop]: Abstraction has has 188 places, 238 transitions, 1819 flow [2021-08-13 01:28:14,207 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 82.58333333333333) internal successors, (991), 12 states have internal predecessors, (991), 0 states have call successors, (0), 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:28:14,207 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:28:14,208 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 01:28:14,208 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-13 01:28:14,208 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:28:14,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:28:14,208 INFO L82 PathProgramCache]: Analyzing trace with hash -256053651, now seen corresponding path program 2 times [2021-08-13 01:28:14,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:28:14,208 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713802245] [2021-08-13 01:28:14,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:28:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:28:14,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:14,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:14,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:14,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:28:14,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:14,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:28:14,328 INFO L142 QuantifierPusher]: treesize reduction 9, result has 66.7 percent of original size [2021-08-13 01:28:14,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-08-13 01:28:14,341 INFO L142 QuantifierPusher]: treesize reduction 37, result has 43.9 percent of original size [2021-08-13 01:28:14,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-08-13 01:28:14,368 INFO L142 QuantifierPusher]: treesize reduction 37, result has 46.4 percent of original size [2021-08-13 01:28:14,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-08-13 01:28:14,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:14,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-08-13 01:28:14,413 INFO L142 QuantifierPusher]: treesize reduction 26, result has 57.4 percent of original size [2021-08-13 01:28:14,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-08-13 01:28:14,438 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:28:14,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:28:14,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:14,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:28:14,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:14,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:28:14,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:28:14,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:28:14,482 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:28:14,482 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:28:14,482 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713802245] [2021-08-13 01:28:14,482 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713802245] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:28:14,482 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:28:14,483 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-13 01:28:14,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246454285] [2021-08-13 01:28:14,483 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-13 01:28:14,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:28:14,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-13 01:28:14,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-08-13 01:28:14,484 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2021-08-13 01:28:14,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 238 transitions, 1819 flow. Second operand has 12 states, 12 states have (on average 84.41666666666667) internal successors, (1013), 12 states have internal predecessors, (1013), 0 states have call successors, (0), 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:28:14,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:28:14,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2021-08-13 01:28:14,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:28:15,158 INFO L129 PetriNetUnfolder]: 1650/4607 cut-off events. [2021-08-13 01:28:15,159 INFO L130 PetriNetUnfolder]: For 2673/5193 co-relation queries the response was YES. [2021-08-13 01:28:15,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15320 conditions, 4607 events. 1650/4607 cut-off events. For 2673/5193 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 50132 event pairs, 1 based on Foata normal form. 10/4271 useless extension candidates. Maximal degree in co-relation 15217. Up to 1318 conditions per place. [2021-08-13 01:28:15,178 INFO L132 encePairwiseOnDemand]: 95/105 looper letters, 20 selfloop transitions, 5 changer transitions 188/289 dead transitions. [2021-08-13 01:28:15,179 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 289 transitions, 2837 flow [2021-08-13 01:28:15,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-13 01:28:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-08-13 01:28:15,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 951 transitions. [2021-08-13 01:28:15,182 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8233766233766234 [2021-08-13 01:28:15,182 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 951 transitions. [2021-08-13 01:28:15,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 951 transitions. [2021-08-13 01:28:15,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:28:15,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 951 transitions. [2021-08-13 01:28:15,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 86.45454545454545) internal successors, (951), 11 states have internal predecessors, (951), 0 states have call successors, (0), 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:28:15,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 105.0) internal successors, (1260), 12 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 01:28:15,189 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 105.0) internal successors, (1260), 12 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 01:28:15,189 INFO L348 CegarLoopForPetriNet]: 110 programPoint places, 88 predicate places. [2021-08-13 01:28:15,189 INFO L482 AbstractCegarLoop]: Abstraction has has 198 places, 289 transitions, 2837 flow [2021-08-13 01:28:15,189 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 84.41666666666667) internal successors, (1013), 12 states have internal predecessors, (1013), 0 states have call successors, (0), 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:28:15,189 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:28:15,190 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 01:28:15,190 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-13 01:28:15,190 INFO L430 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:28:15,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:28:15,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1980937873, now seen corresponding path program 3 times [2021-08-13 01:28:15,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:28:15,191 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108423549] [2021-08-13 01:28:15,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:28:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 01:28:15,222 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 01:28:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 01:28:15,270 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 01:28:15,318 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 01:28:15,318 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 01:28:15,318 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-13 01:28:15,321 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 01:28:15,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 01:28:15 BasicIcfg [2021-08-13 01:28:15,421 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 01:28:15,422 INFO L168 Benchmark]: Toolchain (without parser) took 12223.23 ms. Allocated memory was 202.4 MB in the beginning and 677.4 MB in the end (delta: 475.0 MB). Free memory was 165.3 MB in the beginning and 398.8 MB in the end (delta: -233.5 MB). Peak memory consumption was 241.8 MB. Max. memory is 8.0 GB. [2021-08-13 01:28:15,422 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 202.4 MB. Free memory is still 183.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 01:28:15,422 INFO L168 Benchmark]: CACSL2BoogieTranslator took 611.47 ms. Allocated memory is still 202.4 MB. Free memory was 165.1 MB in the beginning and 160.5 MB in the end (delta: 4.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-08-13 01:28:15,422 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.98 ms. Allocated memory is still 202.4 MB. Free memory was 160.5 MB in the beginning and 157.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 01:28:15,422 INFO L168 Benchmark]: Boogie Preprocessor took 39.83 ms. Allocated memory is still 202.4 MB. Free memory was 157.9 MB in the beginning and 155.8 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:28:15,422 INFO L168 Benchmark]: RCFGBuilder took 1745.73 ms. Allocated memory was 202.4 MB in the beginning and 260.0 MB in the end (delta: 57.7 MB). Free memory was 155.8 MB in the beginning and 230.3 MB in the end (delta: -74.4 MB). Peak memory consumption was 96.0 MB. Max. memory is 8.0 GB. [2021-08-13 01:28:15,423 INFO L168 Benchmark]: TraceAbstraction took 9775.06 ms. Allocated memory was 260.0 MB in the beginning and 677.4 MB in the end (delta: 417.3 MB). Free memory was 229.7 MB in the beginning and 398.8 MB in the end (delta: -169.0 MB). Peak memory consumption was 248.8 MB. Max. memory is 8.0 GB. [2021-08-13 01:28:15,423 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 202.4 MB. Free memory is still 183.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 611.47 ms. Allocated memory is still 202.4 MB. Free memory was 165.1 MB in the beginning and 160.5 MB in the end (delta: 4.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 45.98 ms. Allocated memory is still 202.4 MB. Free memory was 160.5 MB in the beginning and 157.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 39.83 ms. Allocated memory is still 202.4 MB. Free memory was 157.9 MB in the beginning and 155.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1745.73 ms. Allocated memory was 202.4 MB in the beginning and 260.0 MB in the end (delta: 57.7 MB). Free memory was 155.8 MB in the beginning and 230.3 MB in the end (delta: -74.4 MB). Peak memory consumption was 96.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 9775.06 ms. Allocated memory was 260.0 MB in the beginning and 677.4 MB in the end (delta: 417.3 MB). Free memory was 229.7 MB in the beginning and 398.8 MB in the end (delta: -169.0 MB). Peak memory consumption was 248.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2516; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t2517; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] 0 pthread_t t2518; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L826] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L830] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 17.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 9546.6ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 6966.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 64.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 155 SDtfs, 515 SDslu, 581 SDs, 0 SdLazy, 866 SolverSat, 195 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 873.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 2014.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5623occurred in iteration=7, InterpolantAutomatonStates: 148, 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.3ms SsaConstructionTime, 461.5ms SatisfiabilityAnalysisTime, 1693.5ms InterpolantComputationTime, 943 NumberOfCodeBlocks, 943 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 850 ConstructedInterpolants, 0 QuantifiedInterpolants, 4411 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...