/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/mix007_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-12 20:42:02,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-12 20:42:02,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-12 20:42:02,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-12 20:42:02,837 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-12 20:42:02,840 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-12 20:42:02,842 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-12 20:42:02,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-12 20:42:02,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-12 20:42:02,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-12 20:42:02,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-12 20:42:02,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-12 20:42:02,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-12 20:42:02,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-12 20:42:02,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-12 20:42:02,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-12 20:42:02,896 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-12 20:42:02,897 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-12 20:42:02,899 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-12 20:42:02,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-12 20:42:02,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-12 20:42:02,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-12 20:42:02,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-12 20:42:02,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-12 20:42:02,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-12 20:42:02,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-12 20:42:02,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-12 20:42:02,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-12 20:42:02,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-12 20:42:02,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-12 20:42:02,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-12 20:42:02,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-12 20:42:02,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-12 20:42:02,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-12 20:42:02,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-12 20:42:02,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-12 20:42:02,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-12 20:42:02,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-12 20:42:02,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-12 20:42:02,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-12 20:42:02,928 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-12 20:42:02,929 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:42:02,963 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-12 20:42:02,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-12 20:42:02,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-12 20:42:02,966 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-12 20:42:02,967 INFO L138 SettingsManager]: * Use SBE=true [2021-08-12 20:42:02,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-12 20:42:02,967 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-12 20:42:02,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-12 20:42:02,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-12 20:42:02,968 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-12 20:42:02,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-12 20:42:02,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-12 20:42:02,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-12 20:42:02,969 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-12 20:42:02,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-12 20:42:02,969 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-12 20:42:02,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-12 20:42:02,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-12 20:42:02,997 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-12 20:42:02,997 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-12 20:42:02,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-12 20:42:02,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 20:42:02,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-12 20:42:02,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-12 20:42:02,999 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-12 20:42:02,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-12 20:42:02,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-12 20:42:02,999 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-12 20:42:02,999 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-12 20:42:02,999 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-12 20:42:03,000 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:42:03,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-12 20:42:03,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-12 20:42:03,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-12 20:42:03,336 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-12 20:42:03,338 INFO L275 PluginConnector]: CDTParser initialized [2021-08-12 20:42:03,339 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007_power.opt.i [2021-08-12 20:42:03,398 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27ad2589e/47e417f91d2f4847902ed8854d5abbb4/FLAGb7cab3f0f [2021-08-12 20:42:03,924 INFO L306 CDTParser]: Found 1 translation units. [2021-08-12 20:42:03,924 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007_power.opt.i [2021-08-12 20:42:03,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27ad2589e/47e417f91d2f4847902ed8854d5abbb4/FLAGb7cab3f0f [2021-08-12 20:42:04,367 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27ad2589e/47e417f91d2f4847902ed8854d5abbb4 [2021-08-12 20:42:04,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-12 20:42:04,371 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-12 20:42:04,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-12 20:42:04,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-12 20:42:04,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-12 20:42:04,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 08:42:04" (1/1) ... [2021-08-12 20:42:04,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ced25d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:42:04, skipping insertion in model container [2021-08-12 20:42:04,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 08:42:04" (1/1) ... [2021-08-12 20:42:04,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-12 20:42:04,420 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-12 20:42:04,601 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/mix007_power.opt.i[950,963] [2021-08-12 20:42:04,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 20:42:04,838 INFO L203 MainTranslator]: Completed pre-run [2021-08-12 20:42:04,847 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/mix007_power.opt.i[950,963] [2021-08-12 20:42:04,911 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 20:42:04,989 INFO L208 MainTranslator]: Completed translation [2021-08-12 20:42:04,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:42:04 WrapperNode [2021-08-12 20:42:04,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-12 20:42:04,992 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-12 20:42:04,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-12 20:42:04,993 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-12 20:42:04,999 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:42:04" (1/1) ... [2021-08-12 20:42:05,032 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:42:04" (1/1) ... [2021-08-12 20:42:05,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-12 20:42:05,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-12 20:42:05,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-12 20:42:05,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-12 20:42:05,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:42:04" (1/1) ... [2021-08-12 20:42:05,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:42:04" (1/1) ... [2021-08-12 20:42:05,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:42:04" (1/1) ... [2021-08-12 20:42:05,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:42:04" (1/1) ... [2021-08-12 20:42:05,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:42:04" (1/1) ... [2021-08-12 20:42:05,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:42:04" (1/1) ... [2021-08-12 20:42:05,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:42:04" (1/1) ... [2021-08-12 20:42:05,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-12 20:42:05,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-12 20:42:05,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-12 20:42:05,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-12 20:42:05,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:42:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 20:42:05,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-12 20:42:05,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-12 20:42:05,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-12 20:42:05,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-12 20:42:05,215 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-12 20:42:05,215 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-12 20:42:05,216 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-12 20:42:05,216 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-12 20:42:05,216 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-12 20:42:05,216 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-12 20:42:05,216 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-08-12 20:42:05,216 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-08-12 20:42:05,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-12 20:42:05,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-12 20:42:05,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-12 20:42:05,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-12 20:42:05,218 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:42:07,035 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-12 20:42:07,035 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-12 20:42:07,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 08:42:07 BoogieIcfgContainer [2021-08-12 20:42:07,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-12 20:42:07,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-12 20:42:07,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-12 20:42:07,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-12 20:42:07,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.08 08:42:04" (1/3) ... [2021-08-12 20:42:07,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10499e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 08:42:07, skipping insertion in model container [2021-08-12 20:42:07,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:42:04" (2/3) ... [2021-08-12 20:42:07,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10499e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 08:42:07, skipping insertion in model container [2021-08-12 20:42:07,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 08:42:07" (3/3) ... [2021-08-12 20:42:07,046 INFO L111 eAbstractionObserver]: Analyzing ICFG mix007_power.opt.i [2021-08-12 20:42:07,052 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-12 20:42:07,053 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-12 20:42:07,054 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-12 20:42:07,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,096 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,096 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,097 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,097 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,099 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,100 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,100 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,100 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,102 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,102 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,102 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,103 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,121 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,124 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,124 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,133 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,133 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,133 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,134 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,134 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,134 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,134 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,134 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,156 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,156 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,156 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,161 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,161 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,166 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,166 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,168 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,168 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,170 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,171 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,172 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,172 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:42:07,172 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-12 20:42:07,202 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-12 20:42:07,229 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-12 20:42:07,229 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-12 20:42:07,230 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-12 20:42:07,230 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-12 20:42:07,230 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-12 20:42:07,230 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-12 20:42:07,230 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-12 20:42:07,230 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-12 20:42:07,244 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2021-08-12 20:42:07,287 INFO L129 PetriNetUnfolder]: 2/125 cut-off events. [2021-08-12 20:42:07,288 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 20:42:07,291 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2021-08-12 20:42:07,291 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2021-08-12 20:42:07,295 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2021-08-12 20:42:07,311 INFO L129 PetriNetUnfolder]: 0/89 cut-off events. [2021-08-12 20:42:07,311 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 20:42:07,311 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:42:07,312 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:42:07,312 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:42:07,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:42:07,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1881887108, now seen corresponding path program 1 times [2021-08-12 20:42:07,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:42:07,322 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597311639] [2021-08-12 20:42:07,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:42:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:42:07,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:07,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:42:07,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:07,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:42:07,647 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:42:07,647 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:42:07,647 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597311639] [2021-08-12 20:42:07,648 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597311639] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:42:07,648 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:42:07,648 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-12 20:42:07,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970096211] [2021-08-12 20:42:07,654 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 20:42:07,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:42:07,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 20:42:07,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 20:42:07,663 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 129 [2021-08-12 20:42:07,669 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 125 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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:42:07,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:42:07,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 129 [2021-08-12 20:42:07,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:42:07,766 INFO L129 PetriNetUnfolder]: 13/195 cut-off events. [2021-08-12 20:42:07,767 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 20:42:07,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 195 events. 13/195 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 426 event pairs, 5 based on Foata normal form. 6/191 useless extension candidates. Maximal degree in co-relation 183. Up to 25 conditions per place. [2021-08-12 20:42:07,771 INFO L132 encePairwiseOnDemand]: 124/129 looper letters, 6 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2021-08-12 20:42:07,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 123 transitions, 274 flow [2021-08-12 20:42:07,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 20:42:07,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-12 20:42:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2021-08-12 20:42:07,780 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9560723514211886 [2021-08-12 20:42:07,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2021-08-12 20:42:07,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2021-08-12 20:42:07,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:42:07,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2021-08-12 20:42:07,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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:42:07,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 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:42:07,795 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 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:42:07,796 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 0 predicate places. [2021-08-12 20:42:07,796 INFO L482 AbstractCegarLoop]: Abstraction has has 136 places, 123 transitions, 274 flow [2021-08-12 20:42:07,797 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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:42:07,797 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:42:07,797 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:42:07,797 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-12 20:42:07,797 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:42:07,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:42:07,798 INFO L82 PathProgramCache]: Analyzing trace with hash 589722544, now seen corresponding path program 1 times [2021-08-12 20:42:07,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:42:07,798 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645165664] [2021-08-12 20:42:07,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:42:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:42:07,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:07,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:42:07,970 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-08-12 20:42:07,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-08-12 20:42:07,984 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:42:07,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:42:08,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:08,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:42:08,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:08,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:42:08,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:08,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:42:08,020 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:42:08,020 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:42:08,021 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645165664] [2021-08-12 20:42:08,021 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645165664] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:42:08,021 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:42:08,021 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 20:42:08,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533703665] [2021-08-12 20:42:08,023 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 20:42:08,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:42:08,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 20:42:08,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 20:42:08,028 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2021-08-12 20:42:08,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 123 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 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:42:08,029 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:42:08,029 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2021-08-12 20:42:08,029 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:42:09,410 INFO L129 PetriNetUnfolder]: 2337/6511 cut-off events. [2021-08-12 20:42:09,411 INFO L130 PetriNetUnfolder]: For 562/748 co-relation queries the response was YES. [2021-08-12 20:42:09,442 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10833 conditions, 6511 events. 2337/6511 cut-off events. For 562/748 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 65370 event pairs, 517 based on Foata normal form. 0/6267 useless extension candidates. Maximal degree in co-relation 10770. Up to 1632 conditions per place. [2021-08-12 20:42:09,468 INFO L132 encePairwiseOnDemand]: 113/129 looper letters, 40 selfloop transitions, 33 changer transitions 18/193 dead transitions. [2021-08-12 20:42:09,469 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 193 transitions, 638 flow [2021-08-12 20:42:09,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 20:42:09,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-12 20:42:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1039 transitions. [2021-08-12 20:42:09,477 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8949181739879414 [2021-08-12 20:42:09,477 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1039 transitions. [2021-08-12 20:42:09,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1039 transitions. [2021-08-12 20:42:09,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:42:09,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1039 transitions. [2021-08-12 20:42:09,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.44444444444444) internal successors, (1039), 9 states have internal predecessors, (1039), 0 states have call successors, (0), 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:42:09,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 0 states have call successors, (0), 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:42:09,484 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 0 states have call successors, (0), 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:42:09,485 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 8 predicate places. [2021-08-12 20:42:09,485 INFO L482 AbstractCegarLoop]: Abstraction has has 144 places, 193 transitions, 638 flow [2021-08-12 20:42:09,485 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 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:42:09,485 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:42:09,485 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] [2021-08-12 20:42:09,486 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-12 20:42:09,486 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:42:09,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:42:09,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1030932047, now seen corresponding path program 1 times [2021-08-12 20:42:09,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:42:09,486 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121975986] [2021-08-12 20:42:09,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:42:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:42:09,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:09,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:42:09,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:09,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:42:09,623 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-08-12 20:42:09,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-08-12 20:42:09,638 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:42:09,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:42:09,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:09,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:42:09,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:09,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:42:09,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:09,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:42:09,674 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:42:09,675 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:42:09,675 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121975986] [2021-08-12 20:42:09,675 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121975986] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:42:09,675 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:42:09,675 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 20:42:09,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716481234] [2021-08-12 20:42:09,676 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 20:42:09,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:42:09,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 20:42:09,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 20:42:09,677 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2021-08-12 20:42:09,678 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 193 transitions, 638 flow. Second operand has 7 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:42:09,678 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:42:09,678 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2021-08-12 20:42:09,678 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:42:11,065 INFO L129 PetriNetUnfolder]: 2666/7781 cut-off events. [2021-08-12 20:42:11,065 INFO L130 PetriNetUnfolder]: For 936/3066 co-relation queries the response was YES. [2021-08-12 20:42:11,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16868 conditions, 7781 events. 2666/7781 cut-off events. For 936/3066 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 82501 event pairs, 179 based on Foata normal form. 34/7575 useless extension candidates. Maximal degree in co-relation 16797. Up to 2065 conditions per place. [2021-08-12 20:42:11,122 INFO L132 encePairwiseOnDemand]: 118/129 looper letters, 90 selfloop transitions, 52 changer transitions 69/313 dead transitions. [2021-08-12 20:42:11,123 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 313 transitions, 1604 flow [2021-08-12 20:42:11,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 20:42:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-12 20:42:11,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1473 transitions. [2021-08-12 20:42:11,126 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8783542039355993 [2021-08-12 20:42:11,126 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1473 transitions. [2021-08-12 20:42:11,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1473 transitions. [2021-08-12 20:42:11,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:42:11,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1473 transitions. [2021-08-12 20:42:11,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 113.3076923076923) internal successors, (1473), 13 states have internal predecessors, (1473), 0 states have call successors, (0), 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:42:11,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 129.0) internal successors, (1806), 14 states have internal predecessors, (1806), 0 states have call successors, (0), 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:42:11,135 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 129.0) internal successors, (1806), 14 states have internal predecessors, (1806), 0 states have call successors, (0), 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:42:11,135 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 20 predicate places. [2021-08-12 20:42:11,135 INFO L482 AbstractCegarLoop]: Abstraction has has 156 places, 313 transitions, 1604 flow [2021-08-12 20:42:11,136 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:42:11,136 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:42:11,136 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] [2021-08-12 20:42:11,136 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-12 20:42:11,136 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:42:11,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:42:11,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1408360721, now seen corresponding path program 1 times [2021-08-12 20:42:11,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:42:11,137 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747579441] [2021-08-12 20:42:11,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:42:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:42:11,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:11,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:42:11,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:11,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:42:11,205 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:42:11,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:42:11,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:11,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:42:11,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:11,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:42:11,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:11,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:42:11,237 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:42:11,237 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:42:11,237 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747579441] [2021-08-12 20:42:11,237 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747579441] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:42:11,238 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:42:11,238 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 20:42:11,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882976015] [2021-08-12 20:42:11,239 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 20:42:11,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:42:11,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 20:42:11,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 20:42:11,242 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 129 [2021-08-12 20:42:11,244 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 313 transitions, 1604 flow. Second operand has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 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:42:11,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:42:11,244 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 129 [2021-08-12 20:42:11,244 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:42:12,758 INFO L129 PetriNetUnfolder]: 3495/10114 cut-off events. [2021-08-12 20:42:12,759 INFO L130 PetriNetUnfolder]: For 2979/4099 co-relation queries the response was YES. [2021-08-12 20:42:12,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23948 conditions, 10114 events. 3495/10114 cut-off events. For 2979/4099 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 112916 event pairs, 160 based on Foata normal form. 0/9870 useless extension candidates. Maximal degree in co-relation 23874. Up to 2774 conditions per place. [2021-08-12 20:42:12,846 INFO L132 encePairwiseOnDemand]: 123/129 looper letters, 30 selfloop transitions, 29 changer transitions 152/403 dead transitions. [2021-08-12 20:42:12,847 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 403 transitions, 2488 flow [2021-08-12 20:42:12,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 20:42:12,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-12 20:42:12,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1076 transitions. [2021-08-12 20:42:12,850 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9267872523686477 [2021-08-12 20:42:12,850 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1076 transitions. [2021-08-12 20:42:12,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1076 transitions. [2021-08-12 20:42:12,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:42:12,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1076 transitions. [2021-08-12 20:42:12,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.55555555555556) internal successors, (1076), 9 states have internal predecessors, (1076), 0 states have call successors, (0), 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:42:12,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 0 states have call successors, (0), 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:42:12,855 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 0 states have call successors, (0), 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:42:12,856 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 28 predicate places. [2021-08-12 20:42:12,856 INFO L482 AbstractCegarLoop]: Abstraction has has 164 places, 403 transitions, 2488 flow [2021-08-12 20:42:12,856 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 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:42:12,856 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:42:12,856 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, 1] [2021-08-12 20:42:12,856 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-12 20:42:12,857 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:42:12,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:42:12,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1573932325, now seen corresponding path program 1 times [2021-08-12 20:42:12,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:42:12,857 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302900816] [2021-08-12 20:42:12,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:42:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:42:12,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:12,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:42:12,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:12,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:42:12,985 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 20:42:12,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:42:12,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:12,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:42:13,009 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 20:42:13,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:42:13,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:13,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:42:13,018 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:42:13,018 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:42:13,021 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302900816] [2021-08-12 20:42:13,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302900816] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:42:13,022 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:42:13,022 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 20:42:13,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181733916] [2021-08-12 20:42:13,023 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 20:42:13,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:42:13,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 20:42:13,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 20:42:13,024 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 129 [2021-08-12 20:42:13,025 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 403 transitions, 2488 flow. Second operand has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 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:42:13,025 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:42:13,025 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 129 [2021-08-12 20:42:13,025 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:42:15,615 INFO L129 PetriNetUnfolder]: 6971/20340 cut-off events. [2021-08-12 20:42:15,615 INFO L130 PetriNetUnfolder]: For 3817/4386 co-relation queries the response was YES. [2021-08-12 20:42:15,752 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45817 conditions, 20340 events. 6971/20340 cut-off events. For 3817/4386 co-relation queries the response was YES. Maximal size of possible extension queue 1221. Compared 254086 event pairs, 486 based on Foata normal form. 0/19252 useless extension candidates. Maximal degree in co-relation 45740. Up to 4041 conditions per place. [2021-08-12 20:42:15,841 INFO L132 encePairwiseOnDemand]: 118/129 looper letters, 29 selfloop transitions, 20 changer transitions 0/423 dead transitions. [2021-08-12 20:42:15,841 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 423 transitions, 2542 flow [2021-08-12 20:42:15,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 20:42:15,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-12 20:42:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1191 transitions. [2021-08-12 20:42:15,844 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9232558139534883 [2021-08-12 20:42:15,844 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1191 transitions. [2021-08-12 20:42:15,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1191 transitions. [2021-08-12 20:42:15,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:42:15,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1191 transitions. [2021-08-12 20:42:15,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.1) internal successors, (1191), 10 states have internal predecessors, (1191), 0 states have call successors, (0), 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:42:15,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 129.0) internal successors, (1419), 11 states have internal predecessors, (1419), 0 states have call successors, (0), 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:42:15,851 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 129.0) internal successors, (1419), 11 states have internal predecessors, (1419), 0 states have call successors, (0), 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:42:15,851 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 37 predicate places. [2021-08-12 20:42:15,851 INFO L482 AbstractCegarLoop]: Abstraction has has 173 places, 423 transitions, 2542 flow [2021-08-12 20:42:15,851 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 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:42:15,851 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:42:15,851 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, 1, 1, 1] [2021-08-12 20:42:15,852 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-12 20:42:15,852 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:42:15,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:42:15,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1841753738, now seen corresponding path program 1 times [2021-08-12 20:42:15,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:42:15,853 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048668312] [2021-08-12 20:42:15,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:42:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:42:16,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:16,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:42:16,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:16,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:42:16,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:16,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:42:16,021 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 20:42:16,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:42:16,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:16,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:42:16,049 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 20:42:16,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:42:16,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:16,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:42:16,058 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:42:16,058 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:42:16,059 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048668312] [2021-08-12 20:42:16,059 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048668312] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:42:16,059 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:42:16,059 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 20:42:16,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543547291] [2021-08-12 20:42:16,060 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 20:42:16,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:42:16,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 20:42:16,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 20:42:16,061 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 129 [2021-08-12 20:42:16,062 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 423 transitions, 2542 flow. Second operand has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 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:42:16,062 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:42:16,062 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 129 [2021-08-12 20:42:16,062 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:42:17,345 INFO L129 PetriNetUnfolder]: 3420/10115 cut-off events. [2021-08-12 20:42:17,346 INFO L130 PetriNetUnfolder]: For 2218/16267 co-relation queries the response was YES. [2021-08-12 20:42:17,395 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24965 conditions, 10115 events. 3420/10115 cut-off events. For 2218/16267 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 113555 event pairs, 228 based on Foata normal form. 1014/10475 useless extension candidates. Maximal degree in co-relation 24885. Up to 2083 conditions per place. [2021-08-12 20:42:17,437 INFO L132 encePairwiseOnDemand]: 118/129 looper letters, 52 selfloop transitions, 54 changer transitions 45/443 dead transitions. [2021-08-12 20:42:17,437 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 443 transitions, 2698 flow [2021-08-12 20:42:17,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 20:42:17,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-12 20:42:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1550 transitions. [2021-08-12 20:42:17,440 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9242695289206917 [2021-08-12 20:42:17,440 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1550 transitions. [2021-08-12 20:42:17,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1550 transitions. [2021-08-12 20:42:17,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:42:17,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1550 transitions. [2021-08-12 20:42:17,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 119.23076923076923) internal successors, (1550), 13 states have internal predecessors, (1550), 0 states have call successors, (0), 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:42:17,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 129.0) internal successors, (1806), 14 states have internal predecessors, (1806), 0 states have call successors, (0), 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:42:17,448 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 129.0) internal successors, (1806), 14 states have internal predecessors, (1806), 0 states have call successors, (0), 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:42:17,448 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 49 predicate places. [2021-08-12 20:42:17,448 INFO L482 AbstractCegarLoop]: Abstraction has has 185 places, 443 transitions, 2698 flow [2021-08-12 20:42:17,449 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 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:42:17,449 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:42:17,449 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, 1, 1, 1, 1, 1, 1] [2021-08-12 20:42:17,449 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-12 20:42:17,449 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:42:17,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:42:17,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1030025518, now seen corresponding path program 1 times [2021-08-12 20:42:17,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:42:17,450 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850165313] [2021-08-12 20:42:17,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:42:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:42:17,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:17,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:42:17,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:17,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:42:17,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:17,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:42:17,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:17,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:42:17,544 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 20:42:17,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:42:17,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:17,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:42:17,565 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 20:42:17,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:42:17,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:17,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:42:17,574 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:42:17,574 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:42:17,574 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850165313] [2021-08-12 20:42:17,574 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850165313] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:42:17,574 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:42:17,574 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 20:42:17,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751046499] [2021-08-12 20:42:17,575 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 20:42:17,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:42:17,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 20:42:17,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-12 20:42:17,576 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 129 [2021-08-12 20:42:17,577 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 443 transitions, 2698 flow. Second operand has 8 states, 8 states have (on average 115.125) internal successors, (921), 8 states have internal predecessors, (921), 0 states have call successors, (0), 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:42:17,577 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:42:17,577 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 129 [2021-08-12 20:42:17,577 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:42:18,565 INFO L129 PetriNetUnfolder]: 2337/6103 cut-off events. [2021-08-12 20:42:18,565 INFO L130 PetriNetUnfolder]: For 2769/33223 co-relation queries the response was YES. [2021-08-12 20:42:18,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19350 conditions, 6103 events. 2337/6103 cut-off events. For 2769/33223 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 62553 event pairs, 17 based on Foata normal form. 1593/7201 useless extension candidates. Maximal degree in co-relation 19267. Up to 1761 conditions per place. [2021-08-12 20:42:18,614 INFO L132 encePairwiseOnDemand]: 118/129 looper letters, 33 selfloop transitions, 106 changer transitions 119/398 dead transitions. [2021-08-12 20:42:18,614 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 398 transitions, 2598 flow [2021-08-12 20:42:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-12 20:42:18,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-12 20:42:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1909 transitions. [2021-08-12 20:42:18,618 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9249031007751938 [2021-08-12 20:42:18,618 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1909 transitions. [2021-08-12 20:42:18,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1909 transitions. [2021-08-12 20:42:18,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:42:18,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1909 transitions. [2021-08-12 20:42:18,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 119.3125) internal successors, (1909), 16 states have internal predecessors, (1909), 0 states have call successors, (0), 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:42:18,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 129.0) internal successors, (2193), 17 states have internal predecessors, (2193), 0 states have call successors, (0), 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:42:18,626 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 129.0) internal successors, (2193), 17 states have internal predecessors, (2193), 0 states have call successors, (0), 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:42:18,627 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 64 predicate places. [2021-08-12 20:42:18,627 INFO L482 AbstractCegarLoop]: Abstraction has has 200 places, 398 transitions, 2598 flow [2021-08-12 20:42:18,627 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 115.125) internal successors, (921), 8 states have internal predecessors, (921), 0 states have call successors, (0), 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:42:18,627 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:42:18,627 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:42:18,627 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-12 20:42:18,627 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:42:18,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:42:18,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1996736546, now seen corresponding path program 1 times [2021-08-12 20:42:18,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:42:18,628 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954671687] [2021-08-12 20:42:18,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:42:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:42:18,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:18,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:42:18,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:18,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:42:18,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:18,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:42:18,852 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:42:18,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:42:18,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:18,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:42:18,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:18,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:42:18,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:18,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:42:18,893 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:42:18,893 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:42:18,894 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954671687] [2021-08-12 20:42:18,894 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954671687] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:42:18,894 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:42:18,894 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 20:42:18,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372079533] [2021-08-12 20:42:18,895 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 20:42:18,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:42:18,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 20:42:18,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-12 20:42:18,897 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 129 [2021-08-12 20:42:18,898 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 398 transitions, 2598 flow. Second operand has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 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:42:18,898 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:42:18,898 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 129 [2021-08-12 20:42:18,898 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:42:20,093 INFO L129 PetriNetUnfolder]: 4010/10313 cut-off events. [2021-08-12 20:42:20,094 INFO L130 PetriNetUnfolder]: For 4068/14624 co-relation queries the response was YES. [2021-08-12 20:42:20,130 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33014 conditions, 10313 events. 4010/10313 cut-off events. For 4068/14624 co-relation queries the response was YES. Maximal size of possible extension queue 1273. Compared 114507 event pairs, 28 based on Foata normal form. 12/9572 useless extension candidates. Maximal degree in co-relation 32927. Up to 3044 conditions per place. [2021-08-12 20:42:20,167 INFO L132 encePairwiseOnDemand]: 123/129 looper letters, 37 selfloop transitions, 5 changer transitions 173/466 dead transitions. [2021-08-12 20:42:20,167 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 466 transitions, 3410 flow [2021-08-12 20:42:20,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-12 20:42:20,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-08-12 20:42:20,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 834 transitions. [2021-08-12 20:42:20,169 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9235880398671097 [2021-08-12 20:42:20,170 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 834 transitions. [2021-08-12 20:42:20,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 834 transitions. [2021-08-12 20:42:20,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:42:20,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 834 transitions. [2021-08-12 20:42:20,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.14285714285714) internal successors, (834), 7 states have internal predecessors, (834), 0 states have call successors, (0), 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:42:20,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 0 states have call successors, (0), 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:42:20,174 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 0 states have call successors, (0), 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:42:20,174 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 70 predicate places. [2021-08-12 20:42:20,174 INFO L482 AbstractCegarLoop]: Abstraction has has 206 places, 466 transitions, 3410 flow [2021-08-12 20:42:20,174 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 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:42:20,174 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:42:20,175 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:42:20,175 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-12 20:42:20,175 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:42:20,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:42:20,175 INFO L82 PathProgramCache]: Analyzing trace with hash 734032984, now seen corresponding path program 2 times [2021-08-12 20:42:20,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:42:20,175 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128205185] [2021-08-12 20:42:20,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:42:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:42:20,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:20,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:42:20,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:20,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:42:20,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:20,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:42:20,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:20,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:42:20,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:20,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:42:20,422 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 20:42:20,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:42:20,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:20,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:42:20,446 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 20:42:20,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:42:20,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:20,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:42:20,456 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:42:20,456 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:42:20,456 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128205185] [2021-08-12 20:42:20,457 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128205185] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:42:20,457 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:42:20,457 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-12 20:42:20,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819839127] [2021-08-12 20:42:20,459 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-12 20:42:20,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:42:20,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-12 20:42:20,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-12 20:42:20,461 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 129 [2021-08-12 20:42:20,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 466 transitions, 3410 flow. Second operand has 9 states, 9 states have (on average 115.11111111111111) internal successors, (1036), 9 states have internal predecessors, (1036), 0 states have call successors, (0), 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:42:20,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:42:20,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 129 [2021-08-12 20:42:20,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:42:21,690 INFO L129 PetriNetUnfolder]: 3823/9115 cut-off events. [2021-08-12 20:42:21,690 INFO L130 PetriNetUnfolder]: For 7034/50955 co-relation queries the response was YES. [2021-08-12 20:42:21,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36519 conditions, 9115 events. 3823/9115 cut-off events. For 7034/50955 co-relation queries the response was YES. Maximal size of possible extension queue 1273. Compared 101275 event pairs, 16 based on Foata normal form. 2244/10655 useless extension candidates. Maximal degree in co-relation 36429. Up to 2949 conditions per place. [2021-08-12 20:42:21,772 INFO L132 encePairwiseOnDemand]: 118/129 looper letters, 28 selfloop transitions, 111 changer transitions 100/356 dead transitions. [2021-08-12 20:42:21,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 356 transitions, 2784 flow [2021-08-12 20:42:21,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-12 20:42:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-08-12 20:42:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2248 transitions. [2021-08-12 20:42:21,778 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9171766625866993 [2021-08-12 20:42:21,778 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2248 transitions. [2021-08-12 20:42:21,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2248 transitions. [2021-08-12 20:42:21,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:42:21,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2248 transitions. [2021-08-12 20:42:21,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 118.3157894736842) internal successors, (2248), 19 states have internal predecessors, (2248), 0 states have call successors, (0), 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:42:21,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 129.0) internal successors, (2580), 20 states have internal predecessors, (2580), 0 states have call successors, (0), 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:42:21,788 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 129.0) internal successors, (2580), 20 states have internal predecessors, (2580), 0 states have call successors, (0), 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:42:21,789 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 73 predicate places. [2021-08-12 20:42:21,789 INFO L482 AbstractCegarLoop]: Abstraction has has 209 places, 356 transitions, 2784 flow [2021-08-12 20:42:21,789 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 115.11111111111111) internal successors, (1036), 9 states have internal predecessors, (1036), 0 states have call successors, (0), 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:42:21,789 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:42:21,789 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:42:21,789 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-12 20:42:21,790 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:42:21,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:42:21,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1071499192, now seen corresponding path program 1 times [2021-08-12 20:42:21,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:42:21,790 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288824832] [2021-08-12 20:42:21,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:42:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:42:21,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:21,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:42:21,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:21,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:42:21,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:21,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:42:21,869 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-08-12 20:42:21,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-08-12 20:42:21,881 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:42:21,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:42:21,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:21,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:42:21,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:21,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:42:21,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:21,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:42:21,920 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:42:21,920 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:42:21,920 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288824832] [2021-08-12 20:42:21,920 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288824832] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:42:21,920 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:42:21,920 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 20:42:21,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041283172] [2021-08-12 20:42:21,920 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 20:42:21,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:42:21,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 20:42:21,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-12 20:42:21,922 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2021-08-12 20:42:21,923 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 356 transitions, 2784 flow. Second operand has 8 states, 8 states have (on average 106.625) internal successors, (853), 8 states have internal predecessors, (853), 0 states have call successors, (0), 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:42:21,923 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:42:21,923 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2021-08-12 20:42:21,923 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:42:23,810 INFO L129 PetriNetUnfolder]: 7369/16874 cut-off events. [2021-08-12 20:42:23,811 INFO L130 PetriNetUnfolder]: For 12382/39086 co-relation queries the response was YES. [2021-08-12 20:42:23,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68551 conditions, 16874 events. 7369/16874 cut-off events. For 12382/39086 co-relation queries the response was YES. Maximal size of possible extension queue 2214. Compared 197352 event pairs, 24 based on Foata normal form. 53/15609 useless extension candidates. Maximal degree in co-relation 68452. Up to 5610 conditions per place. [2021-08-12 20:42:24,009 INFO L132 encePairwiseOnDemand]: 112/129 looper letters, 22 selfloop transitions, 13 changer transitions 170/410 dead transitions. [2021-08-12 20:42:24,010 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 410 transitions, 3462 flow [2021-08-12 20:42:24,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-12 20:42:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-08-12 20:42:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1304 transitions. [2021-08-12 20:42:24,013 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8423772609819121 [2021-08-12 20:42:24,013 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1304 transitions. [2021-08-12 20:42:24,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1304 transitions. [2021-08-12 20:42:24,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:42:24,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1304 transitions. [2021-08-12 20:42:24,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 108.66666666666667) internal successors, (1304), 12 states have internal predecessors, (1304), 0 states have call successors, (0), 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:42:24,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 129.0) internal successors, (1677), 13 states have internal predecessors, (1677), 0 states have call successors, (0), 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:42:24,019 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 129.0) internal successors, (1677), 13 states have internal predecessors, (1677), 0 states have call successors, (0), 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:42:24,019 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 84 predicate places. [2021-08-12 20:42:24,019 INFO L482 AbstractCegarLoop]: Abstraction has has 220 places, 410 transitions, 3462 flow [2021-08-12 20:42:24,020 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 106.625) internal successors, (853), 8 states have internal predecessors, (853), 0 states have call successors, (0), 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:42:24,020 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:42:24,020 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:42:24,020 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-12 20:42:24,020 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:42:24,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:42:24,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1115859936, now seen corresponding path program 2 times [2021-08-12 20:42:24,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:42:24,021 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472813210] [2021-08-12 20:42:24,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:42:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:42:24,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:24,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:42:24,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:24,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:42:24,111 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-08-12 20:42:24,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-08-12 20:42:24,130 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:42:24,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:42:24,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:24,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:42:24,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:24,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:42:24,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:42:24,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:42:24,162 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:42:24,162 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:42:24,162 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472813210] [2021-08-12 20:42:24,162 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472813210] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:42:24,162 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:42:24,163 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 20:42:24,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147790297] [2021-08-12 20:42:24,163 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 20:42:24,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:42:24,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 20:42:24,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 20:42:24,164 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2021-08-12 20:42:24,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 410 transitions, 3462 flow. Second operand has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 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:42:24,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:42:24,165 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2021-08-12 20:42:24,165 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:42:26,506 INFO L129 PetriNetUnfolder]: 9781/21937 cut-off events. [2021-08-12 20:42:26,506 INFO L130 PetriNetUnfolder]: For 13564/45076 co-relation queries the response was YES. [2021-08-12 20:42:26,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90241 conditions, 21937 events. 9781/21937 cut-off events. For 13564/45076 co-relation queries the response was YES. Maximal size of possible extension queue 2824. Compared 263729 event pairs, 20 based on Foata normal form. 72/20319 useless extension candidates. Maximal degree in co-relation 90134. Up to 7451 conditions per place. [2021-08-12 20:42:26,786 INFO L132 encePairwiseOnDemand]: 116/129 looper letters, 73 selfloop transitions, 19 changer transitions 142/452 dead transitions. [2021-08-12 20:42:26,786 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 452 transitions, 4214 flow [2021-08-12 20:42:26,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-12 20:42:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-08-12 20:42:26,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 778 transitions. [2021-08-12 20:42:26,788 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8615725359911407 [2021-08-12 20:42:26,788 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 778 transitions. [2021-08-12 20:42:26,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 778 transitions. [2021-08-12 20:42:26,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:42:26,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 778 transitions. [2021-08-12 20:42:26,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 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:42:26,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 0 states have call successors, (0), 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:42:26,792 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 0 states have call successors, (0), 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:42:26,792 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 90 predicate places. [2021-08-12 20:42:26,792 INFO L482 AbstractCegarLoop]: Abstraction has has 226 places, 452 transitions, 4214 flow [2021-08-12 20:42:26,793 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 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:42:26,793 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:42:26,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:42:26,793 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-12 20:42:26,793 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:42:26,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:42:26,794 INFO L82 PathProgramCache]: Analyzing trace with hash -37792092, now seen corresponding path program 3 times [2021-08-12 20:42:26,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:42:26,794 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952924774] [2021-08-12 20:42:26,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:42:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 20:42:26,841 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 20:42:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 20:42:26,886 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 20:42:26,927 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-12 20:42:26,927 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-12 20:42:26,927 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-12 20:42:26,930 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-12 20:42:27,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.08 08:42:27 BasicIcfg [2021-08-12 20:42:27,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-12 20:42:27,137 INFO L168 Benchmark]: Toolchain (without parser) took 22763.73 ms. Allocated memory was 196.1 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 160.2 MB in the beginning and 3.2 GB in the end (delta: -3.0 GB). Peak memory consumption was 938.9 MB. Max. memory is 8.0 GB. [2021-08-12 20:42:27,137 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 196.1 MB. Free memory is still 178.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-12 20:42:27,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 616.81 ms. Allocated memory is still 196.1 MB. Free memory was 160.0 MB in the beginning and 153.1 MB in the end (delta: 7.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-08-12 20:42:27,137 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.14 ms. Allocated memory is still 196.1 MB. Free memory was 153.1 MB in the beginning and 150.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-12 20:42:27,140 INFO L168 Benchmark]: Boogie Preprocessor took 54.31 ms. Allocated memory is still 196.1 MB. Free memory was 149.9 MB in the beginning and 147.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-12 20:42:27,140 INFO L168 Benchmark]: RCFGBuilder took 1903.66 ms. Allocated memory was 196.1 MB in the beginning and 266.3 MB in the end (delta: 70.3 MB). Free memory was 147.5 MB in the beginning and 214.8 MB in the end (delta: -67.3 MB). Peak memory consumption was 109.7 MB. Max. memory is 8.0 GB. [2021-08-12 20:42:27,141 INFO L168 Benchmark]: TraceAbstraction took 20094.66 ms. Allocated memory was 266.3 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 214.8 MB in the beginning and 3.2 GB in the end (delta: -3.0 GB). Peak memory consumption was 922.8 MB. Max. memory is 8.0 GB. [2021-08-12 20:42:27,142 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.44 ms. Allocated memory is still 196.1 MB. Free memory is still 178.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 616.81 ms. Allocated memory is still 196.1 MB. Free memory was 160.0 MB in the beginning and 153.1 MB in the end (delta: 7.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 86.14 ms. Allocated memory is still 196.1 MB. Free memory was 153.1 MB in the beginning and 150.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 54.31 ms. Allocated memory is still 196.1 MB. Free memory was 149.9 MB in the beginning and 147.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1903.66 ms. Allocated memory was 196.1 MB in the beginning and 266.3 MB in the end (delta: 70.3 MB). Free memory was 147.5 MB in the beginning and 214.8 MB in the end (delta: -67.3 MB). Peak memory consumption was 109.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 20094.66 ms. Allocated memory was 266.3 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 214.8 MB in the beginning and 3.2 GB in the end (delta: -3.0 GB). Peak memory consumption was 922.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0] [L720] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L722] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L730] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L731] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L732] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L733] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L734] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L735] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L736] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L737] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L738] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L739] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L740] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L741] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L742] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L743] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L744] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L745] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L746] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L747] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L748] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L869] 0 pthread_t t181; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L870] FCALL, FORK 0 pthread_create(&t181, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 pthread_t t182; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L872] FCALL, FORK 0 pthread_create(&t182, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t183; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L874] FCALL, FORK 0 pthread_create(&t183, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t184; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L876] FCALL, FORK 0 pthread_create(&t184, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L832] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L832] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L795] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L796] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L797] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L798] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L799] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L800] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = z [L802] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L847] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L882] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L882] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L882] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L889] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 164 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 15.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 19703.9ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 17273.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 65.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 196 SDtfs, 416 SDslu, 635 SDs, 0 SdLazy, 637 SolverSat, 185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 631.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1220.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=4214occurred in iteration=11, InterpolantAutomatonStates: 118, 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: 53.8ms SsaConstructionTime, 809.3ms SatisfiabilityAnalysisTime, 1211.1ms InterpolantComputationTime, 1077 NumberOfCodeBlocks, 1077 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 966 ConstructedInterpolants, 0 QuantifiedInterpolants, 4650 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...