/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-12 20:51:17,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-12 20:51:17,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-12 20:51:17,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-12 20:51:17,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-12 20:51:17,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-12 20:51:17,965 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-12 20:51:17,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-12 20:51:17,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-12 20:51:17,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-12 20:51:17,975 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-12 20:51:17,976 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-12 20:51:17,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-12 20:51:17,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-12 20:51:17,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-12 20:51:17,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-12 20:51:17,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-12 20:51:17,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-12 20:51:17,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-12 20:51:17,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-12 20:51:18,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-12 20:51:18,006 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-12 20:51:18,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-12 20:51:18,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-12 20:51:18,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-12 20:51:18,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-12 20:51:18,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-12 20:51:18,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-12 20:51:18,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-12 20:51:18,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-12 20:51:18,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-12 20:51:18,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-12 20:51:18,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-12 20:51:18,012 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-12 20:51:18,016 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-12 20:51:18,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-12 20:51:18,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-12 20:51:18,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-12 20:51:18,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-12 20:51:18,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-12 20:51:18,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-12 20:51:18,018 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2021-08-12 20:51:18,046 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-12 20:51:18,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-12 20:51:18,049 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-12 20:51:18,049 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-12 20:51:18,049 INFO L138 SettingsManager]: * Use SBE=true [2021-08-12 20:51:18,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-12 20:51:18,049 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-12 20:51:18,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-12 20:51:18,049 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-12 20:51:18,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-12 20:51:18,050 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-12 20:51:18,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-12 20:51:18,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-12 20:51:18,051 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-12 20:51:18,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-12 20:51:18,051 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-12 20:51:18,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-12 20:51:18,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-12 20:51:18,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-12 20:51:18,051 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-12 20:51:18,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-12 20:51:18,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 20:51:18,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-12 20:51:18,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-12 20:51:18,052 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-12 20:51:18,052 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-12 20:51:18,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-12 20:51:18,052 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-12 20:51:18,053 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-12 20:51:18,053 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-12 20:51:18,053 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-08-12 20:51:18,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-12 20:51:18,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-12 20:51:18,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-12 20:51:18,302 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-12 20:51:18,302 INFO L275 PluginConnector]: CDTParser initialized [2021-08-12 20:51:18,303 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_rmo.opt.i [2021-08-12 20:51:18,350 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7abfba433/72b59dab3e8740a4b26e3e45100547a9/FLAG3f79842bb [2021-08-12 20:51:18,837 INFO L306 CDTParser]: Found 1 translation units. [2021-08-12 20:51:18,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_rmo.opt.i [2021-08-12 20:51:18,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7abfba433/72b59dab3e8740a4b26e3e45100547a9/FLAG3f79842bb [2021-08-12 20:51:18,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7abfba433/72b59dab3e8740a4b26e3e45100547a9 [2021-08-12 20:51:18,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-12 20:51:18,871 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-12 20:51:18,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-12 20:51:18,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-12 20:51:18,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-12 20:51:18,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 08:51:18" (1/1) ... [2021-08-12 20:51:18,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee5bc22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:51:18, skipping insertion in model container [2021-08-12 20:51:18,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 08:51:18" (1/1) ... [2021-08-12 20:51:18,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-12 20:51:18,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-12 20:51:19,055 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/mix042_rmo.opt.i[948,961] [2021-08-12 20:51:19,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 20:51:19,207 INFO L203 MainTranslator]: Completed pre-run [2021-08-12 20:51:19,214 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/mix042_rmo.opt.i[948,961] [2021-08-12 20:51:19,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 20:51:19,288 INFO L208 MainTranslator]: Completed translation [2021-08-12 20:51:19,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:51:19 WrapperNode [2021-08-12 20:51:19,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-12 20:51:19,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-12 20:51:19,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-12 20:51:19,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-12 20:51:19,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:51:19" (1/1) ... [2021-08-12 20:51:19,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:51:19" (1/1) ... [2021-08-12 20:51:19,331 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-12 20:51:19,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-12 20:51:19,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-12 20:51:19,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-12 20:51:19,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:51:19" (1/1) ... [2021-08-12 20:51:19,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:51:19" (1/1) ... [2021-08-12 20:51:19,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:51:19" (1/1) ... [2021-08-12 20:51:19,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:51:19" (1/1) ... [2021-08-12 20:51:19,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:51:19" (1/1) ... [2021-08-12 20:51:19,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:51:19" (1/1) ... [2021-08-12 20:51:19,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:51:19" (1/1) ... [2021-08-12 20:51:19,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-12 20:51:19,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-12 20:51:19,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-12 20:51:19,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-12 20:51:19,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:51:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 20:51:19,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-12 20:51:19,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-12 20:51:19,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-12 20:51:19,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-12 20:51:19,423 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-12 20:51:19,423 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-12 20:51:19,424 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-12 20:51:19,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-12 20:51:19,424 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-12 20:51:19,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-12 20:51:19,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-12 20:51:19,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-12 20:51:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-12 20:51:19,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-12 20:51:19,426 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-12 20:51:20,640 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-12 20:51:20,640 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-12 20:51:20,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 08:51:20 BoogieIcfgContainer [2021-08-12 20:51:20,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-12 20:51:20,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-12 20:51:20,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-12 20:51:20,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-12 20:51:20,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.08 08:51:18" (1/3) ... [2021-08-12 20:51:20,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6906023c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 08:51:20, skipping insertion in model container [2021-08-12 20:51:20,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:51:19" (2/3) ... [2021-08-12 20:51:20,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6906023c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 08:51:20, skipping insertion in model container [2021-08-12 20:51:20,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 08:51:20" (3/3) ... [2021-08-12 20:51:20,646 INFO L111 eAbstractionObserver]: Analyzing ICFG mix042_rmo.opt.i [2021-08-12 20:51:20,650 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-12 20:51:20,651 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-12 20:51:20,651 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-12 20:51:20,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,673 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,673 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,673 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,673 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,674 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,674 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,675 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,675 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,678 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,678 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,678 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,678 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,678 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,679 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,679 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,679 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,706 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,706 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,712 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,712 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,713 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,714 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,715 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:51:20,716 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-12 20:51:20,733 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-12 20:51:20,751 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-12 20:51:20,752 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-12 20:51:20,752 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-12 20:51:20,755 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-12 20:51:20,756 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-12 20:51:20,756 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-12 20:51:20,756 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-12 20:51:20,756 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-12 20:51:20,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2021-08-12 20:51:20,803 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2021-08-12 20:51:20,803 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 20:51:20,805 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2021-08-12 20:51:20,805 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2021-08-12 20:51:20,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2021-08-12 20:51:20,825 INFO L129 PetriNetUnfolder]: 0/72 cut-off events. [2021-08-12 20:51:20,825 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 20:51:20,825 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:51:20,826 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:51:20,826 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-12 20:51:20,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:51:20,830 INFO L82 PathProgramCache]: Analyzing trace with hash -978306701, now seen corresponding path program 1 times [2021-08-12 20:51:20,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:51:20,835 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38500219] [2021-08-12 20:51:20,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:51:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:51:21,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:21,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:51:21,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:21,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:51:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:51:21,025 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:51:21,025 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38500219] [2021-08-12 20:51:21,026 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38500219] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:51:21,026 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:51:21,026 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-12 20:51:21,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493845779] [2021-08-12 20:51:21,032 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 20:51:21,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:51:21,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 20:51:21,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 20:51:21,041 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 110 [2021-08-12 20:51:21,043 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 107 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:21,044 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:51:21,044 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 110 [2021-08-12 20:51:21,044 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:51:21,122 INFO L129 PetriNetUnfolder]: 16/221 cut-off events. [2021-08-12 20:51:21,123 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 20:51:21,124 INFO L84 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 221 events. 16/221 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 663 event pairs, 6 based on Foata normal form. 9/219 useless extension candidates. Maximal degree in co-relation 216. Up to 27 conditions per place. [2021-08-12 20:51:21,126 INFO L132 encePairwiseOnDemand]: 105/110 looper letters, 7 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2021-08-12 20:51:21,126 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 106 transitions, 239 flow [2021-08-12 20:51:21,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 20:51:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-12 20:51:21,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2021-08-12 20:51:21,138 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9515151515151515 [2021-08-12 20:51:21,139 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2021-08-12 20:51:21,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2021-08-12 20:51:21,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:51:21,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2021-08-12 20:51:21,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:21,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:21,150 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:21,150 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 0 predicate places. [2021-08-12 20:51:21,150 INFO L482 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 239 flow [2021-08-12 20:51:21,150 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:21,151 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:51:21,151 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:51:21,151 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-12 20:51:21,151 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-12 20:51:21,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:51:21,151 INFO L82 PathProgramCache]: Analyzing trace with hash -779061261, now seen corresponding path program 1 times [2021-08-12 20:51:21,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:51:21,152 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526989638] [2021-08-12 20:51:21,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:51:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:51:21,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:21,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:51:21,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:21,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:51:21,323 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:51:21,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:51:21,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:21,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:51:21,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:21,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:51:21,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:21,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:51:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:51:21,359 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:51:21,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526989638] [2021-08-12 20:51:21,359 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526989638] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:51:21,359 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:51:21,359 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 20:51:21,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936133528] [2021-08-12 20:51:21,360 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 20:51:21,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:51:21,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 20:51:21,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 20:51:21,362 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 110 [2021-08-12 20:51:21,362 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:21,363 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:51:21,363 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 110 [2021-08-12 20:51:21,363 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:51:21,476 INFO L129 PetriNetUnfolder]: 30/319 cut-off events. [2021-08-12 20:51:21,476 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-08-12 20:51:21,477 INFO L84 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 319 events. 30/319 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1471 event pairs, 6 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 396. Up to 45 conditions per place. [2021-08-12 20:51:21,478 INFO L132 encePairwiseOnDemand]: 104/110 looper letters, 7 selfloop transitions, 2 changer transitions 13/118 dead transitions. [2021-08-12 20:51:21,478 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 118 transitions, 309 flow [2021-08-12 20:51:21,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 20:51:21,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-12 20:51:21,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 905 transitions. [2021-08-12 20:51:21,480 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9141414141414141 [2021-08-12 20:51:21,480 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 905 transitions. [2021-08-12 20:51:21,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 905 transitions. [2021-08-12 20:51:21,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:51:21,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 905 transitions. [2021-08-12 20:51:21,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.55555555555556) internal successors, (905), 9 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:21,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:21,485 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:21,485 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 8 predicate places. [2021-08-12 20:51:21,485 INFO L482 AbstractCegarLoop]: Abstraction has has 123 places, 118 transitions, 309 flow [2021-08-12 20:51:21,486 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:21,486 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:51:21,486 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:51:21,486 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-12 20:51:21,486 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-12 20:51:21,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:51:21,486 INFO L82 PathProgramCache]: Analyzing trace with hash -212336426, now seen corresponding path program 1 times [2021-08-12 20:51:21,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:51:21,487 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113732204] [2021-08-12 20:51:21,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:51:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:51:21,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:21,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:51:21,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:21,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:51:21,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:21,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:51:21,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:21,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 20:51:21,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:21,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-12 20:51:21,591 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-08-12 20:51:21,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-12 20:51:21,610 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:51:21,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:51:21,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:21,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:51:21,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:21,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:51:21,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:21,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:51:21,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:51:21,661 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:51:21,661 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113732204] [2021-08-12 20:51:21,661 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113732204] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:51:21,661 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:51:21,661 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 20:51:21,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848355147] [2021-08-12 20:51:21,662 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 20:51:21,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:51:21,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 20:51:21,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-12 20:51:21,665 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 110 [2021-08-12 20:51:21,665 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 118 transitions, 309 flow. Second operand has 10 states, 10 states have (on average 90.3) internal successors, (903), 10 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:21,665 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:51:21,666 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 110 [2021-08-12 20:51:21,666 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:51:22,036 INFO L129 PetriNetUnfolder]: 196/829 cut-off events. [2021-08-12 20:51:22,036 INFO L130 PetriNetUnfolder]: For 173/211 co-relation queries the response was YES. [2021-08-12 20:51:22,039 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1550 conditions, 829 events. 196/829 cut-off events. For 173/211 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5655 event pairs, 32 based on Foata normal form. 2/821 useless extension candidates. Maximal degree in co-relation 1490. Up to 166 conditions per place. [2021-08-12 20:51:22,041 INFO L132 encePairwiseOnDemand]: 99/110 looper letters, 16 selfloop transitions, 8 changer transitions 81/182 dead transitions. [2021-08-12 20:51:22,041 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 182 transitions, 735 flow [2021-08-12 20:51:22,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-12 20:51:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-12 20:51:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1487 transitions. [2021-08-12 20:51:22,044 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8448863636363636 [2021-08-12 20:51:22,044 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1487 transitions. [2021-08-12 20:51:22,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1487 transitions. [2021-08-12 20:51:22,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:51:22,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1487 transitions. [2021-08-12 20:51:22,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 92.9375) internal successors, (1487), 16 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:22,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 110.0) internal successors, (1870), 17 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:22,050 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 110.0) internal successors, (1870), 17 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:22,050 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 23 predicate places. [2021-08-12 20:51:22,051 INFO L482 AbstractCegarLoop]: Abstraction has has 138 places, 182 transitions, 735 flow [2021-08-12 20:51:22,051 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 90.3) internal successors, (903), 10 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:22,051 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:51:22,051 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:51:22,051 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-12 20:51:22,051 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-12 20:51:22,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:51:22,052 INFO L82 PathProgramCache]: Analyzing trace with hash -466192105, now seen corresponding path program 1 times [2021-08-12 20:51:22,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:51:22,052 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893204345] [2021-08-12 20:51:22,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:51:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:51:22,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:22,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:51:22,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:22,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:51:22,149 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 20:51:22,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:51:22,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:22,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:51:22,166 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 20:51:22,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:51:22,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:22,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:51:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:51:22,174 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:51:22,174 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893204345] [2021-08-12 20:51:22,175 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893204345] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:51:22,175 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:51:22,175 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 20:51:22,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145030815] [2021-08-12 20:51:22,176 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 20:51:22,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:51:22,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 20:51:22,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 20:51:22,177 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2021-08-12 20:51:22,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 182 transitions, 735 flow. Second operand has 6 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:22,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:51:22,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2021-08-12 20:51:22,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:51:22,448 INFO L129 PetriNetUnfolder]: 444/1633 cut-off events. [2021-08-12 20:51:22,448 INFO L130 PetriNetUnfolder]: For 262/332 co-relation queries the response was YES. [2021-08-12 20:51:22,452 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3093 conditions, 1633 events. 444/1633 cut-off events. For 262/332 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 13522 event pairs, 58 based on Foata normal form. 0/1558 useless extension candidates. Maximal degree in co-relation 3030. Up to 350 conditions per place. [2021-08-12 20:51:22,457 INFO L132 encePairwiseOnDemand]: 100/110 looper letters, 21 selfloop transitions, 15 changer transitions 63/212 dead transitions. [2021-08-12 20:51:22,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 212 transitions, 877 flow [2021-08-12 20:51:22,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 20:51:22,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-12 20:51:22,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1003 transitions. [2021-08-12 20:51:22,459 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9118181818181819 [2021-08-12 20:51:22,460 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1003 transitions. [2021-08-12 20:51:22,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1003 transitions. [2021-08-12 20:51:22,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:51:22,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1003 transitions. [2021-08-12 20:51:22,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.3) internal successors, (1003), 10 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:22,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 110.0) internal successors, (1210), 11 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:22,464 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 110.0) internal successors, (1210), 11 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:22,464 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 32 predicate places. [2021-08-12 20:51:22,464 INFO L482 AbstractCegarLoop]: Abstraction has has 147 places, 212 transitions, 877 flow [2021-08-12 20:51:22,465 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:22,465 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:51:22,465 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] [2021-08-12 20:51:22,465 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-12 20:51:22,465 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-12 20:51:22,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:51:22,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1477621861, now seen corresponding path program 1 times [2021-08-12 20:51:22,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:51:22,466 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469960856] [2021-08-12 20:51:22,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:51:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:51:22,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:22,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:51:22,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:22,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:51:22,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:22,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:51:22,549 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 20:51:22,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:51:22,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:22,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:51:22,568 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 20:51:22,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:51:22,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:22,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:51:22,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:51:22,575 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:51:22,575 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469960856] [2021-08-12 20:51:22,575 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469960856] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:51:22,575 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:51:22,575 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 20:51:22,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064031869] [2021-08-12 20:51:22,576 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 20:51:22,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:51:22,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 20:51:22,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 20:51:22,577 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2021-08-12 20:51:22,578 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 212 transitions, 877 flow. Second operand has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:22,578 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:51:22,578 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2021-08-12 20:51:22,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:51:22,749 INFO L129 PetriNetUnfolder]: 203/704 cut-off events. [2021-08-12 20:51:22,750 INFO L130 PetriNetUnfolder]: For 99/804 co-relation queries the response was YES. [2021-08-12 20:51:22,751 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1625 conditions, 704 events. 203/704 cut-off events. For 99/804 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4285 event pairs, 7 based on Foata normal form. 73/734 useless extension candidates. Maximal degree in co-relation 1559. Up to 142 conditions per place. [2021-08-12 20:51:22,753 INFO L132 encePairwiseOnDemand]: 100/110 looper letters, 22 selfloop transitions, 36 changer transitions 42/198 dead transitions. [2021-08-12 20:51:22,753 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 198 transitions, 887 flow [2021-08-12 20:51:22,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 20:51:22,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-12 20:51:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1305 transitions. [2021-08-12 20:51:22,756 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9125874125874126 [2021-08-12 20:51:22,756 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1305 transitions. [2021-08-12 20:51:22,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1305 transitions. [2021-08-12 20:51:22,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:51:22,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1305 transitions. [2021-08-12 20:51:22,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 100.38461538461539) internal successors, (1305), 13 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:22,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 110.0) internal successors, (1540), 14 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:22,760 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 110.0) internal successors, (1540), 14 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:22,760 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 35 predicate places. [2021-08-12 20:51:22,760 INFO L482 AbstractCegarLoop]: Abstraction has has 150 places, 198 transitions, 887 flow [2021-08-12 20:51:22,761 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:22,761 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:51:22,761 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:51:22,761 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-12 20:51:22,761 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-12 20:51:22,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:51:22,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1430138851, now seen corresponding path program 1 times [2021-08-12 20:51:22,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:51:22,761 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094652255] [2021-08-12 20:51:22,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:51:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:51:22,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:22,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:51:22,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:22,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:51:22,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:22,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:51:22,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:22,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:51:22,846 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 20:51:22,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:51:22,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:22,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:51:22,864 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 20:51:22,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:51:22,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:22,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:51:22,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:51:22,871 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:51:22,872 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094652255] [2021-08-12 20:51:22,872 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094652255] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:51:22,872 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:51:22,872 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 20:51:22,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458964285] [2021-08-12 20:51:22,873 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 20:51:22,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:51:22,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 20:51:22,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-12 20:51:22,900 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2021-08-12 20:51:22,900 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 198 transitions, 887 flow. Second operand has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:22,900 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:51:22,900 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2021-08-12 20:51:22,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:51:23,109 INFO L129 PetriNetUnfolder]: 163/513 cut-off events. [2021-08-12 20:51:23,109 INFO L130 PetriNetUnfolder]: For 182/1560 co-relation queries the response was YES. [2021-08-12 20:51:23,111 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 513 events. 163/513 cut-off events. For 182/1560 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2951 event pairs, 0 based on Foata normal form. 109/591 useless extension candidates. Maximal degree in co-relation 1477. Up to 131 conditions per place. [2021-08-12 20:51:23,112 INFO L132 encePairwiseOnDemand]: 100/110 looper letters, 19 selfloop transitions, 40 changer transitions 61/207 dead transitions. [2021-08-12 20:51:23,112 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 207 transitions, 1163 flow [2021-08-12 20:51:23,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-12 20:51:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-12 20:51:23,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1592 transitions. [2021-08-12 20:51:23,115 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9045454545454545 [2021-08-12 20:51:23,115 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1592 transitions. [2021-08-12 20:51:23,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1592 transitions. [2021-08-12 20:51:23,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:51:23,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1592 transitions. [2021-08-12 20:51:23,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 99.5) internal successors, (1592), 16 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:23,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 110.0) internal successors, (1870), 17 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:23,121 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 110.0) internal successors, (1870), 17 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:23,121 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 44 predicate places. [2021-08-12 20:51:23,121 INFO L482 AbstractCegarLoop]: Abstraction has has 159 places, 207 transitions, 1163 flow [2021-08-12 20:51:23,121 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:23,121 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:51:23,121 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:51:23,122 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-12 20:51:23,122 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-12 20:51:23,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:51:23,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1523074943, now seen corresponding path program 1 times [2021-08-12 20:51:23,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:51:23,122 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800888321] [2021-08-12 20:51:23,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:51:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:51:23,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:23,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:51:23,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:23,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:51:23,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:23,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:51:23,204 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:51:23,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:51:23,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:23,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:51:23,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:23,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:51:23,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:23,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:51:23,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:51:23,227 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:51:23,227 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800888321] [2021-08-12 20:51:23,228 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800888321] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:51:23,228 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:51:23,228 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 20:51:23,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755700461] [2021-08-12 20:51:23,228 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 20:51:23,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:51:23,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 20:51:23,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-12 20:51:23,229 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2021-08-12 20:51:23,230 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 207 transitions, 1163 flow. Second operand has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:23,230 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:51:23,230 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2021-08-12 20:51:23,230 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:51:23,344 INFO L129 PetriNetUnfolder]: 328/1039 cut-off events. [2021-08-12 20:51:23,345 INFO L130 PetriNetUnfolder]: For 442/1494 co-relation queries the response was YES. [2021-08-12 20:51:23,349 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3112 conditions, 1039 events. 328/1039 cut-off events. For 442/1494 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 8162 event pairs, 0 based on Foata normal form. 0/978 useless extension candidates. Maximal degree in co-relation 3039. Up to 265 conditions per place. [2021-08-12 20:51:23,351 INFO L132 encePairwiseOnDemand]: 104/110 looper letters, 9 selfloop transitions, 2 changer transitions 66/213 dead transitions. [2021-08-12 20:51:23,351 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 213 transitions, 1231 flow [2021-08-12 20:51:23,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-12 20:51:23,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-08-12 20:51:23,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 690 transitions. [2021-08-12 20:51:23,353 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8961038961038961 [2021-08-12 20:51:23,353 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 690 transitions. [2021-08-12 20:51:23,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 690 transitions. [2021-08-12 20:51:23,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:51:23,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 690 transitions. [2021-08-12 20:51:23,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:23,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 110.0) internal successors, (880), 8 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:23,357 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 110.0) internal successors, (880), 8 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:23,357 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 50 predicate places. [2021-08-12 20:51:23,357 INFO L482 AbstractCegarLoop]: Abstraction has has 165 places, 213 transitions, 1231 flow [2021-08-12 20:51:23,357 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:23,357 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:51:23,357 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:51:23,358 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-12 20:51:23,358 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-12 20:51:23,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:51:23,358 INFO L82 PathProgramCache]: Analyzing trace with hash 954052769, now seen corresponding path program 2 times [2021-08-12 20:51:23,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:51:23,358 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299362460] [2021-08-12 20:51:23,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:51:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:51:23,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:23,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:51:23,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:23,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:51:23,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:23,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:51:23,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:23,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 20:51:23,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:23,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-12 20:51:23,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:23,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-08-12 20:51:23,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:23,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-08-12 20:51:23,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:23,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-08-12 20:51:23,504 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:51:23,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:51:23,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:23,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:51:23,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:23,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:51:23,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:51:23,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:51:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:51:23,539 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:51:23,539 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299362460] [2021-08-12 20:51:23,539 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299362460] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:51:23,539 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:51:23,539 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-12 20:51:23,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513877296] [2021-08-12 20:51:23,540 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-12 20:51:23,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:51:23,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-12 20:51:23,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-08-12 20:51:23,541 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 110 [2021-08-12 20:51:23,542 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 213 transitions, 1231 flow. Second operand has 12 states, 12 states have (on average 87.58333333333333) internal successors, (1051), 12 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:23,542 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:51:23,542 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 110 [2021-08-12 20:51:23,542 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:51:23,898 INFO L129 PetriNetUnfolder]: 781/2607 cut-off events. [2021-08-12 20:51:23,898 INFO L130 PetriNetUnfolder]: For 1245/3862 co-relation queries the response was YES. [2021-08-12 20:51:23,908 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7641 conditions, 2607 events. 781/2607 cut-off events. For 1245/3862 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 26217 event pairs, 2 based on Foata normal form. 6/2417 useless extension candidates. Maximal degree in co-relation 7560. Up to 614 conditions per place. [2021-08-12 20:51:23,912 INFO L132 encePairwiseOnDemand]: 99/110 looper letters, 17 selfloop transitions, 5 changer transitions 96/240 dead transitions. [2021-08-12 20:51:23,912 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 240 transitions, 1505 flow [2021-08-12 20:51:23,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-12 20:51:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-08-12 20:51:23,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1248 transitions. [2021-08-12 20:51:23,914 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8103896103896104 [2021-08-12 20:51:23,914 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1248 transitions. [2021-08-12 20:51:23,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1248 transitions. [2021-08-12 20:51:23,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:51:23,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1248 transitions. [2021-08-12 20:51:23,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 89.14285714285714) internal successors, (1248), 14 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:23,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 110.0) internal successors, (1650), 15 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:23,919 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 110.0) internal successors, (1650), 15 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:23,920 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 63 predicate places. [2021-08-12 20:51:23,920 INFO L482 AbstractCegarLoop]: Abstraction has has 178 places, 240 transitions, 1505 flow [2021-08-12 20:51:23,920 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 87.58333333333333) internal successors, (1051), 12 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:51:23,920 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:51:23,920 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:51:23,921 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-12 20:51:23,921 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-12 20:51:23,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:51:23,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1848557795, now seen corresponding path program 3 times [2021-08-12 20:51:23,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:51:23,921 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608925558] [2021-08-12 20:51:23,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:51:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 20:51:23,946 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 20:51:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 20:51:23,982 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 20:51:24,019 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-12 20:51:24,019 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-12 20:51:24,019 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-12 20:51:24,022 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-12 20:51:24,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.08 08:51:24 BasicIcfg [2021-08-12 20:51:24,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-12 20:51:24,122 INFO L168 Benchmark]: Toolchain (without parser) took 5250.65 ms. Allocated memory was 213.9 MB in the beginning and 463.5 MB in the end (delta: 249.6 MB). Free memory was 176.5 MB in the beginning and 204.1 MB in the end (delta: -27.6 MB). Peak memory consumption was 223.4 MB. Max. memory is 8.0 GB. [2021-08-12 20:51:24,122 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 213.9 MB. Free memory is still 194.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-12 20:51:24,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.36 ms. Allocated memory is still 213.9 MB. Free memory was 176.4 MB in the beginning and 172.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 8.0 GB. [2021-08-12 20:51:24,122 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.35 ms. Allocated memory is still 213.9 MB. Free memory was 172.4 MB in the beginning and 168.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-12 20:51:24,123 INFO L168 Benchmark]: Boogie Preprocessor took 25.34 ms. Allocated memory is still 213.9 MB. Free memory was 168.9 MB in the beginning and 166.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-12 20:51:24,123 INFO L168 Benchmark]: RCFGBuilder took 1273.25 ms. Allocated memory is still 213.9 MB. Free memory was 166.8 MB in the beginning and 81.8 MB in the end (delta: 85.0 MB). Peak memory consumption was 99.7 MB. Max. memory is 8.0 GB. [2021-08-12 20:51:24,123 INFO L168 Benchmark]: TraceAbstraction took 3478.41 ms. Allocated memory was 213.9 MB in the beginning and 463.5 MB in the end (delta: 249.6 MB). Free memory was 81.3 MB in the beginning and 204.1 MB in the end (delta: -122.8 MB). Peak memory consumption was 126.7 MB. Max. memory is 8.0 GB. [2021-08-12 20:51:24,124 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.34 ms. Allocated memory is still 213.9 MB. Free memory is still 194.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 415.36 ms. Allocated memory is still 213.9 MB. Free memory was 176.4 MB in the beginning and 172.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 42.35 ms. Allocated memory is still 213.9 MB. Free memory was 172.4 MB in the beginning and 168.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 25.34 ms. Allocated memory is still 213.9 MB. Free memory was 168.9 MB in the beginning and 166.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1273.25 ms. Allocated memory is still 213.9 MB. Free memory was 166.8 MB in the beginning and 81.8 MB in the end (delta: 85.0 MB). Peak memory consumption was 99.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 3478.41 ms. Allocated memory was 213.9 MB in the beginning and 463.5 MB in the end (delta: 249.6 MB). Free memory was 81.3 MB in the beginning and 204.1 MB in the end (delta: -122.8 MB). Peak memory consumption was 126.7 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] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L724] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L725] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L726] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L727] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L728] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L729] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L734] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L735] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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}] [L736] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L737] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L738] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L739] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L741] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L742] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, 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] [L743] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L825] 0 pthread_t t1120; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L826] FCALL, FORK 0 pthread_create(&t1120, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L827] 0 pthread_t t1121; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, 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] [L828] FCALL, FORK 0 pthread_create(&t1121, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L829] 0 pthread_t t1122; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L830] FCALL, FORK 0 pthread_create(&t1122, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L794] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L797] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L800] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L762] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1] [L768] 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) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] 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) [L768] 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) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 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 [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 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 [L803] 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) [L803] 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) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L805] 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 [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L807] 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 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, 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=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, 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=1] [L836] 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) [L836] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L836] 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) [L836] 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) [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 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 [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L840] 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 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] 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) [L847] 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) [L848] 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)) [L848] 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)) [L849] 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)) [L849] 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)) [L850] 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)) [L850] 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)) [L851] 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)) [L851] 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)) [L852] 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)) [L852] 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)) [L853] 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)) [L853] 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)) [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=1] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 16.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 3272.0ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1828.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 52.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 79 SDtfs, 281 SDslu, 276 SDs, 0 SdLazy, 422 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 286.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 801.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1505occurred in iteration=8, InterpolantAutomatonStates: 88, 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: 39.5ms SsaConstructionTime, 352.0ms SatisfiabilityAnalysisTime, 749.7ms InterpolantComputationTime, 694 NumberOfCodeBlocks, 694 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 600 ConstructedInterpolants, 0 QuantifiedInterpolants, 2125 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...