/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:15:33,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:15:33,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:15:33,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:15:33,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:15:33,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:15:33,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:15:33,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:15:33,740 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:15:33,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:15:33,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:15:33,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:15:33,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:15:33,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:15:33,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:15:33,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:15:33,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:15:33,753 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:15:33,756 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:15:33,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:15:33,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:15:33,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:15:33,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:15:33,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:15:33,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:15:33,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:15:33,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:15:33,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:15:33,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:15:33,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:15:33,776 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:15:33,777 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:15:33,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:15:33,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:15:33,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:15:33,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:15:33,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:15:33,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:15:33,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:15:33,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:15:33,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:15:33,793 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:15:33,837 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:15:33,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:15:33,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:15:33,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:15:33,839 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:15:33,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:15:33,840 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:15:33,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:15:33,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:15:33,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:15:33,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:15:33,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:15:33,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:15:33,842 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:15:33,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:15:33,843 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:15:33,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:15:33,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:15:33,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:15:33,843 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:15:33,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:15:33,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:15:33,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:15:33,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:15:33,844 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:15:33,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:15:33,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:15:33,845 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:15:33,845 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:15:33,845 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:15:34,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:15:34,186 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:15:34,189 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:15:34,191 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:15:34,191 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:15:34,192 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_power.opt.i [2020-10-11 18:15:34,247 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad6ebdf6/1182237a44b64eeebd4d33e19ff88829/FLAGe48c0bdaa [2020-10-11 18:15:34,725 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:15:34,726 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_power.opt.i [2020-10-11 18:15:34,743 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad6ebdf6/1182237a44b64eeebd4d33e19ff88829/FLAGe48c0bdaa [2020-10-11 18:15:35,063 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad6ebdf6/1182237a44b64eeebd4d33e19ff88829 [2020-10-11 18:15:35,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:15:35,073 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:15:35,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:15:35,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:15:35,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:15:35,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:15:35" (1/1) ... [2020-10-11 18:15:35,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d75f09a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:35, skipping insertion in model container [2020-10-11 18:15:35,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:15:35" (1/1) ... [2020-10-11 18:15:35,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:15:35,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:15:35,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:15:35,725 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:15:35,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:15:35,873 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:15:35,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:35 WrapperNode [2020-10-11 18:15:35,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:15:35,876 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:15:35,876 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:15:35,876 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:15:35,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:35" (1/1) ... [2020-10-11 18:15:35,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:35" (1/1) ... [2020-10-11 18:15:35,938 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:15:35,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:15:35,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:15:35,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:15:35,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:35" (1/1) ... [2020-10-11 18:15:35,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:35" (1/1) ... [2020-10-11 18:15:35,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:35" (1/1) ... [2020-10-11 18:15:35,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:35" (1/1) ... [2020-10-11 18:15:35,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:35" (1/1) ... [2020-10-11 18:15:35,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:35" (1/1) ... [2020-10-11 18:15:35,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:35" (1/1) ... [2020-10-11 18:15:35,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:15:35,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:15:35,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:15:35,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:15:35,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:35" (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 [2020-10-11 18:15:36,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:15:36,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:15:36,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:15:36,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:15:36,063 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:15:36,064 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:15:36,064 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:15:36,065 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:15:36,065 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:15:36,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:15:36,066 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-11 18:15:36,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-11 18:15:36,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:15:36,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:15:36,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:15:36,070 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:15:38,039 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:15:38,039 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:15:38,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:15:38 BoogieIcfgContainer [2020-10-11 18:15:38,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:15:38,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:15:38,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:15:38,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:15:38,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:15:35" (1/3) ... [2020-10-11 18:15:38,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a176a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:15:38, skipping insertion in model container [2020-10-11 18:15:38,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:35" (2/3) ... [2020-10-11 18:15:38,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a176a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:15:38, skipping insertion in model container [2020-10-11 18:15:38,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:15:38" (3/3) ... [2020-10-11 18:15:38,051 INFO L111 eAbstractionObserver]: Analyzing ICFG mix027_power.opt.i [2020-10-11 18:15:38,063 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:15:38,071 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:15:38,072 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:15:38,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,105 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,105 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,107 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,107 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,118 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,118 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,119 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,119 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,121 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,121 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,122 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,122 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,122 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,122 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,123 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,123 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,123 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,123 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,123 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,130 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,131 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,131 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,136 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,137 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,143 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,147 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,150 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,150 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,150 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,150 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,151 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:15:38,172 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-11 18:15:38,195 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:15:38,195 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:15:38,195 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:15:38,195 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:15:38,196 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:15:38,196 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:15:38,196 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:15:38,196 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:15:38,217 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 240 flow [2020-10-11 18:15:38,305 INFO L129 PetriNetUnfolder]: 2/106 cut-off events. [2020-10-11 18:15:38,305 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:15:38,314 INFO L80 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2020-10-11 18:15:38,315 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 110 transitions, 240 flow [2020-10-11 18:15:38,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 106 transitions, 224 flow [2020-10-11 18:15:38,364 INFO L129 PetriNetUnfolder]: 0/61 cut-off events. [2020-10-11 18:15:38,365 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:15:38,365 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:15:38,367 INFO L255 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] [2020-10-11 18:15:38,367 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:15:38,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:15:38,376 INFO L82 PathProgramCache]: Analyzing trace with hash -606133094, now seen corresponding path program 1 times [2020-10-11 18:15:38,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:15:38,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973174848] [2020-10-11 18:15:38,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:15:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:15:38,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:15:38,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973174848] [2020-10-11 18:15:38,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:15:38,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:15:38,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818795708] [2020-10-11 18:15:38,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:15:38,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:15:38,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:15:38,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:15:38,844 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 110 [2020-10-11 18:15:38,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 106 transitions, 224 flow. Second operand 3 states. [2020-10-11 18:15:38,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:15:38,847 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 110 [2020-10-11 18:15:38,848 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:15:38,880 INFO L129 PetriNetUnfolder]: 0/103 cut-off events. [2020-10-11 18:15:38,880 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:15:38,881 INFO L80 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 103 events. 0/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 4/105 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:15:38,882 INFO L132 encePairwiseOnDemand]: 105/110 looper letters, 0 selfloop transitions, 2 changer transitions 13/103 dead transitions. [2020-10-11 18:15:38,882 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 103 transitions, 222 flow [2020-10-11 18:15:38,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:15:38,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:15:38,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2020-10-11 18:15:38,899 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9757575757575757 [2020-10-11 18:15:38,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2020-10-11 18:15:38,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2020-10-11 18:15:38,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:15:38,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2020-10-11 18:15:38,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:15:38,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:15:38,916 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:15:38,918 INFO L185 Difference]: Start difference. First operand has 117 places, 106 transitions, 224 flow. Second operand 3 states and 322 transitions. [2020-10-11 18:15:38,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 103 transitions, 222 flow [2020-10-11 18:15:38,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 103 transitions, 218 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-11 18:15:38,929 INFO L241 Difference]: Finished difference. Result has 114 places, 90 transitions, 192 flow [2020-10-11 18:15:38,932 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=114, PETRI_TRANSITIONS=90} [2020-10-11 18:15:38,933 INFO L341 CegarLoopForPetriNet]: 117 programPoint places, -3 predicate places. [2020-10-11 18:15:38,933 INFO L481 AbstractCegarLoop]: Abstraction has has 114 places, 90 transitions, 192 flow [2020-10-11 18:15:38,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:15:38,933 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:15:38,933 INFO L255 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] [2020-10-11 18:15:38,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:15:38,934 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:15:38,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:15:38,934 INFO L82 PathProgramCache]: Analyzing trace with hash 68362799, now seen corresponding path program 1 times [2020-10-11 18:15:38,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:15:38,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105189183] [2020-10-11 18:15:38,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:15:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:15:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:15:39,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105189183] [2020-10-11 18:15:39,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:15:39,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:15:39,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019138776] [2020-10-11 18:15:39,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:15:39,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:15:39,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:15:39,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:15:39,319 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 110 [2020-10-11 18:15:39,320 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 90 transitions, 192 flow. Second operand 6 states. [2020-10-11 18:15:39,320 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:15:39,320 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 110 [2020-10-11 18:15:39,321 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:15:39,445 INFO L129 PetriNetUnfolder]: 3/106 cut-off events. [2020-10-11 18:15:39,445 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:15:39,446 INFO L80 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 106 events. 3/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 2/108 useless extension candidates. Maximal degree in co-relation 97. Up to 7 conditions per place. [2020-10-11 18:15:39,447 INFO L132 encePairwiseOnDemand]: 104/110 looper letters, 6 selfloop transitions, 2 changer transitions 10/100 dead transitions. [2020-10-11 18:15:39,447 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 100 transitions, 248 flow [2020-10-11 18:15:39,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:15:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:15:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 920 transitions. [2020-10-11 18:15:39,454 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9292929292929293 [2020-10-11 18:15:39,454 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 920 transitions. [2020-10-11 18:15:39,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 920 transitions. [2020-10-11 18:15:39,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:15:39,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 920 transitions. [2020-10-11 18:15:39,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:15:39,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:15:39,463 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:15:39,463 INFO L185 Difference]: Start difference. First operand has 114 places, 90 transitions, 192 flow. Second operand 9 states and 920 transitions. [2020-10-11 18:15:39,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 100 transitions, 248 flow [2020-10-11 18:15:39,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 100 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:15:39,467 INFO L241 Difference]: Finished difference. Result has 114 places, 90 transitions, 208 flow [2020-10-11 18:15:39,468 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=208, PETRI_PLACES=114, PETRI_TRANSITIONS=90} [2020-10-11 18:15:39,469 INFO L341 CegarLoopForPetriNet]: 117 programPoint places, -3 predicate places. [2020-10-11 18:15:39,469 INFO L481 AbstractCegarLoop]: Abstraction has has 114 places, 90 transitions, 208 flow [2020-10-11 18:15:39,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:15:39,469 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:15:39,469 INFO L255 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] [2020-10-11 18:15:39,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:15:39,470 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:15:39,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:15:39,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1246484300, now seen corresponding path program 1 times [2020-10-11 18:15:39,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:15:39,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040945888] [2020-10-11 18:15:39,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:15:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:15:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:15:39,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040945888] [2020-10-11 18:15:39,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:15:39,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:15:39,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877654286] [2020-10-11 18:15:39,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:15:39,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:15:39,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:15:39,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:15:39,810 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 110 [2020-10-11 18:15:39,811 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 90 transitions, 208 flow. Second operand 6 states. [2020-10-11 18:15:39,811 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:15:39,811 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 110 [2020-10-11 18:15:39,812 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:15:39,946 INFO L129 PetriNetUnfolder]: 24/161 cut-off events. [2020-10-11 18:15:39,947 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2020-10-11 18:15:39,948 INFO L80 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 161 events. 24/161 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 423 event pairs, 5 based on Foata normal form. 4/163 useless extension candidates. Maximal degree in co-relation 251. Up to 31 conditions per place. [2020-10-11 18:15:39,949 INFO L132 encePairwiseOnDemand]: 103/110 looper letters, 8 selfloop transitions, 3 changer transitions 19/111 dead transitions. [2020-10-11 18:15:39,950 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 111 transitions, 328 flow [2020-10-11 18:15:39,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:15:39,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:15:39,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 923 transitions. [2020-10-11 18:15:39,954 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9323232323232323 [2020-10-11 18:15:39,954 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 923 transitions. [2020-10-11 18:15:39,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 923 transitions. [2020-10-11 18:15:39,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:15:39,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 923 transitions. [2020-10-11 18:15:39,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:15:39,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:15:39,960 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:15:39,960 INFO L185 Difference]: Start difference. First operand has 114 places, 90 transitions, 208 flow. Second operand 9 states and 923 transitions. [2020-10-11 18:15:39,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 111 transitions, 328 flow [2020-10-11 18:15:39,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 111 transitions, 296 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-11 18:15:39,969 INFO L241 Difference]: Finished difference. Result has 115 places, 92 transitions, 235 flow [2020-10-11 18:15:39,969 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=235, PETRI_PLACES=115, PETRI_TRANSITIONS=92} [2020-10-11 18:15:39,970 INFO L341 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2020-10-11 18:15:39,970 INFO L481 AbstractCegarLoop]: Abstraction has has 115 places, 92 transitions, 235 flow [2020-10-11 18:15:39,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:15:39,972 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:15:39,973 INFO L255 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] [2020-10-11 18:15:39,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:15:39,973 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:15:39,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:15:39,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1273257747, now seen corresponding path program 1 times [2020-10-11 18:15:39,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:15:39,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080955467] [2020-10-11 18:15:39,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:15:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:15:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:15:40,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080955467] [2020-10-11 18:15:40,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:15:40,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:15:40,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129394267] [2020-10-11 18:15:40,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:15:40,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:15:40,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:15:40,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:15:40,316 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2020-10-11 18:15:40,317 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 92 transitions, 235 flow. Second operand 6 states. [2020-10-11 18:15:40,317 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:15:40,317 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2020-10-11 18:15:40,318 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:15:40,674 INFO L129 PetriNetUnfolder]: 401/945 cut-off events. [2020-10-11 18:15:40,675 INFO L130 PetriNetUnfolder]: For 465/465 co-relation queries the response was YES. [2020-10-11 18:15:40,685 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1974 conditions, 945 events. 401/945 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6080 event pairs, 42 based on Foata normal form. 20/906 useless extension candidates. Maximal degree in co-relation 1920. Up to 278 conditions per place. [2020-10-11 18:15:40,694 INFO L132 encePairwiseOnDemand]: 100/110 looper letters, 21 selfloop transitions, 17 changer transitions 4/123 dead transitions. [2020-10-11 18:15:40,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 123 transitions, 381 flow [2020-10-11 18:15:40,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:15:40,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:15:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 908 transitions. [2020-10-11 18:15:40,699 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9171717171717172 [2020-10-11 18:15:40,699 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 908 transitions. [2020-10-11 18:15:40,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 908 transitions. [2020-10-11 18:15:40,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:15:40,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 908 transitions. [2020-10-11 18:15:40,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:15:40,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:15:40,705 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:15:40,705 INFO L185 Difference]: Start difference. First operand has 115 places, 92 transitions, 235 flow. Second operand 9 states and 908 transitions. [2020-10-11 18:15:40,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 123 transitions, 381 flow [2020-10-11 18:15:40,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 123 transitions, 372 flow, removed 3 selfloop flow, removed 4 redundant places. [2020-10-11 18:15:40,715 INFO L241 Difference]: Finished difference. Result has 118 places, 107 transitions, 349 flow [2020-10-11 18:15:40,716 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=349, PETRI_PLACES=118, PETRI_TRANSITIONS=107} [2020-10-11 18:15:40,716 INFO L341 CegarLoopForPetriNet]: 117 programPoint places, 1 predicate places. [2020-10-11 18:15:40,716 INFO L481 AbstractCegarLoop]: Abstraction has has 118 places, 107 transitions, 349 flow [2020-10-11 18:15:40,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:15:40,717 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:15:40,717 INFO L255 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] [2020-10-11 18:15:40,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:15:40,718 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:15:40,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:15:40,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2014385210, now seen corresponding path program 1 times [2020-10-11 18:15:40,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:15:40,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847873106] [2020-10-11 18:15:40,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:15:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:15:40,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:15:40,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847873106] [2020-10-11 18:15:40,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:15:40,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:15:40,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635884348] [2020-10-11 18:15:40,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:15:40,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:15:40,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:15:40,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:15:41,027 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 110 [2020-10-11 18:15:41,028 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 107 transitions, 349 flow. Second operand 6 states. [2020-10-11 18:15:41,028 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:15:41,029 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 110 [2020-10-11 18:15:41,029 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:15:41,378 INFO L129 PetriNetUnfolder]: 255/1054 cut-off events. [2020-10-11 18:15:41,378 INFO L130 PetriNetUnfolder]: For 921/1129 co-relation queries the response was YES. [2020-10-11 18:15:41,386 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2799 conditions, 1054 events. 255/1054 cut-off events. For 921/1129 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8274 event pairs, 117 based on Foata normal form. 41/1018 useless extension candidates. Maximal degree in co-relation 2741. Up to 368 conditions per place. [2020-10-11 18:15:41,392 INFO L132 encePairwiseOnDemand]: 104/110 looper letters, 14 selfloop transitions, 11 changer transitions 11/121 dead transitions. [2020-10-11 18:15:41,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 121 transitions, 469 flow [2020-10-11 18:15:41,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:15:41,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:15:41,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 917 transitions. [2020-10-11 18:15:41,396 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9262626262626262 [2020-10-11 18:15:41,397 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 917 transitions. [2020-10-11 18:15:41,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 917 transitions. [2020-10-11 18:15:41,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:15:41,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 917 transitions. [2020-10-11 18:15:41,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:15:41,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:15:41,402 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:15:41,402 INFO L185 Difference]: Start difference. First operand has 118 places, 107 transitions, 349 flow. Second operand 9 states and 917 transitions. [2020-10-11 18:15:41,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 121 transitions, 469 flow [2020-10-11 18:15:41,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 121 transitions, 459 flow, removed 4 selfloop flow, removed 1 redundant places. [2020-10-11 18:15:41,409 INFO L241 Difference]: Finished difference. Result has 132 places, 104 transitions, 387 flow [2020-10-11 18:15:41,410 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=387, PETRI_PLACES=132, PETRI_TRANSITIONS=104} [2020-10-11 18:15:41,410 INFO L341 CegarLoopForPetriNet]: 117 programPoint places, 15 predicate places. [2020-10-11 18:15:41,410 INFO L481 AbstractCegarLoop]: Abstraction has has 132 places, 104 transitions, 387 flow [2020-10-11 18:15:41,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:15:41,410 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:15:41,411 INFO L255 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] [2020-10-11 18:15:41,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:15:41,411 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:15:41,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:15:41,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1137944788, now seen corresponding path program 1 times [2020-10-11 18:15:41,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:15:41,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799169241] [2020-10-11 18:15:41,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:15:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:15:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:15:41,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799169241] [2020-10-11 18:15:41,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:15:41,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:15:41,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785020333] [2020-10-11 18:15:41,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:15:41,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:15:41,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:15:41,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:15:41,680 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2020-10-11 18:15:41,681 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 104 transitions, 387 flow. Second operand 7 states. [2020-10-11 18:15:41,682 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:15:41,682 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2020-10-11 18:15:41,682 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:15:42,035 INFO L129 PetriNetUnfolder]: 417/1073 cut-off events. [2020-10-11 18:15:42,035 INFO L130 PetriNetUnfolder]: For 3000/3301 co-relation queries the response was YES. [2020-10-11 18:15:42,044 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3856 conditions, 1073 events. 417/1073 cut-off events. For 3000/3301 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7181 event pairs, 16 based on Foata normal form. 38/1053 useless extension candidates. Maximal degree in co-relation 3791. Up to 473 conditions per place. [2020-10-11 18:15:42,050 INFO L132 encePairwiseOnDemand]: 100/110 looper letters, 12 selfloop transitions, 11 changer transitions 23/135 dead transitions. [2020-10-11 18:15:42,050 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 135 transitions, 696 flow [2020-10-11 18:15:42,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 18:15:42,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-11 18:15:42,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1008 transitions. [2020-10-11 18:15:42,054 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9163636363636364 [2020-10-11 18:15:42,054 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1008 transitions. [2020-10-11 18:15:42,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1008 transitions. [2020-10-11 18:15:42,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:15:42,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1008 transitions. [2020-10-11 18:15:42,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-11 18:15:42,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-11 18:15:42,060 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-11 18:15:42,060 INFO L185 Difference]: Start difference. First operand has 132 places, 104 transitions, 387 flow. Second operand 10 states and 1008 transitions. [2020-10-11 18:15:42,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 135 transitions, 696 flow [2020-10-11 18:15:42,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 135 transitions, 584 flow, removed 50 selfloop flow, removed 5 redundant places. [2020-10-11 18:15:42,072 INFO L241 Difference]: Finished difference. Result has 138 places, 108 transitions, 428 flow [2020-10-11 18:15:42,072 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=428, PETRI_PLACES=138, PETRI_TRANSITIONS=108} [2020-10-11 18:15:42,073 INFO L341 CegarLoopForPetriNet]: 117 programPoint places, 21 predicate places. [2020-10-11 18:15:42,073 INFO L481 AbstractCegarLoop]: Abstraction has has 138 places, 108 transitions, 428 flow [2020-10-11 18:15:42,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:15:42,073 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:15:42,073 INFO L255 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] [2020-10-11 18:15:42,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:15:42,074 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:15:42,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:15:42,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1713501194, now seen corresponding path program 1 times [2020-10-11 18:15:42,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:15:42,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640044860] [2020-10-11 18:15:42,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:15:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:15:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:15:42,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640044860] [2020-10-11 18:15:42,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:15:42,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:15:42,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514392384] [2020-10-11 18:15:42,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:15:42,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:15:42,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:15:42,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:15:42,506 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2020-10-11 18:15:42,506 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 108 transitions, 428 flow. Second operand 8 states. [2020-10-11 18:15:42,507 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:15:42,507 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2020-10-11 18:15:42,507 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:15:42,796 INFO L129 PetriNetUnfolder]: 196/590 cut-off events. [2020-10-11 18:15:42,797 INFO L130 PetriNetUnfolder]: For 2717/3095 co-relation queries the response was YES. [2020-10-11 18:15:42,801 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2464 conditions, 590 events. 196/590 cut-off events. For 2717/3095 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3169 event pairs, 3 based on Foata normal form. 43/607 useless extension candidates. Maximal degree in co-relation 2395. Up to 257 conditions per place. [2020-10-11 18:15:42,803 INFO L132 encePairwiseOnDemand]: 100/110 looper letters, 12 selfloop transitions, 15 changer transitions 31/139 dead transitions. [2020-10-11 18:15:42,804 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 139 transitions, 850 flow [2020-10-11 18:15:42,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:15:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:15:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1108 transitions. [2020-10-11 18:15:42,808 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.915702479338843 [2020-10-11 18:15:42,808 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1108 transitions. [2020-10-11 18:15:42,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1108 transitions. [2020-10-11 18:15:42,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:15:42,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1108 transitions. [2020-10-11 18:15:42,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:15:42,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:15:42,814 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:15:42,815 INFO L185 Difference]: Start difference. First operand has 138 places, 108 transitions, 428 flow. Second operand 11 states and 1108 transitions. [2020-10-11 18:15:42,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 139 transitions, 850 flow [2020-10-11 18:15:42,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 139 transitions, 736 flow, removed 46 selfloop flow, removed 8 redundant places. [2020-10-11 18:15:42,827 INFO L241 Difference]: Finished difference. Result has 142 places, 104 transitions, 442 flow [2020-10-11 18:15:42,828 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=442, PETRI_PLACES=142, PETRI_TRANSITIONS=104} [2020-10-11 18:15:42,828 INFO L341 CegarLoopForPetriNet]: 117 programPoint places, 25 predicate places. [2020-10-11 18:15:42,828 INFO L481 AbstractCegarLoop]: Abstraction has has 142 places, 104 transitions, 442 flow [2020-10-11 18:15:42,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:15:42,828 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:15:42,829 INFO L255 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] [2020-10-11 18:15:42,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:15:42,830 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:15:42,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:15:42,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1817694784, now seen corresponding path program 1 times [2020-10-11 18:15:42,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:15:42,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329436322] [2020-10-11 18:15:42,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:15:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:15:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:15:43,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329436322] [2020-10-11 18:15:43,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:15:43,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:15:43,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858540549] [2020-10-11 18:15:43,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:15:43,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:15:43,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:15:43,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:15:43,293 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 110 [2020-10-11 18:15:43,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 104 transitions, 442 flow. Second operand 7 states. [2020-10-11 18:15:43,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:15:43,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 110 [2020-10-11 18:15:43,294 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:15:43,473 INFO L129 PetriNetUnfolder]: 127/591 cut-off events. [2020-10-11 18:15:43,474 INFO L130 PetriNetUnfolder]: For 2281/2436 co-relation queries the response was YES. [2020-10-11 18:15:43,478 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 591 events. 127/591 cut-off events. For 2281/2436 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3501 event pairs, 17 based on Foata normal form. 15/580 useless extension candidates. Maximal degree in co-relation 2028. Up to 182 conditions per place. [2020-10-11 18:15:43,482 INFO L132 encePairwiseOnDemand]: 104/110 looper letters, 18 selfloop transitions, 2 changer transitions 4/118 dead transitions. [2020-10-11 18:15:43,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 118 transitions, 578 flow [2020-10-11 18:15:43,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:15:43,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:15:43,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 711 transitions. [2020-10-11 18:15:43,485 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9233766233766234 [2020-10-11 18:15:43,485 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 711 transitions. [2020-10-11 18:15:43,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 711 transitions. [2020-10-11 18:15:43,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:15:43,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 711 transitions. [2020-10-11 18:15:43,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:15:43,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:15:43,490 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:15:43,490 INFO L185 Difference]: Start difference. First operand has 142 places, 104 transitions, 442 flow. Second operand 7 states and 711 transitions. [2020-10-11 18:15:43,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 118 transitions, 578 flow [2020-10-11 18:15:43,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 118 transitions, 449 flow, removed 51 selfloop flow, removed 16 redundant places. [2020-10-11 18:15:43,500 INFO L241 Difference]: Finished difference. Result has 127 places, 105 transitions, 364 flow [2020-10-11 18:15:43,501 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=364, PETRI_PLACES=127, PETRI_TRANSITIONS=105} [2020-10-11 18:15:43,501 INFO L341 CegarLoopForPetriNet]: 117 programPoint places, 10 predicate places. [2020-10-11 18:15:43,501 INFO L481 AbstractCegarLoop]: Abstraction has has 127 places, 105 transitions, 364 flow [2020-10-11 18:15:43,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:15:43,501 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:15:43,501 INFO L255 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] [2020-10-11 18:15:43,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:15:43,502 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:15:43,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:15:43,502 INFO L82 PathProgramCache]: Analyzing trace with hash 399227690, now seen corresponding path program 2 times [2020-10-11 18:15:43,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:15:43,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513141572] [2020-10-11 18:15:43,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:15:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:15:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:15:43,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513141572] [2020-10-11 18:15:43,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:15:43,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:15:43,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338277645] [2020-10-11 18:15:43,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:15:43,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:15:43,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:15:43,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:15:43,938 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2020-10-11 18:15:43,939 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 105 transitions, 364 flow. Second operand 9 states. [2020-10-11 18:15:43,939 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:15:43,939 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2020-10-11 18:15:43,939 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:15:44,265 INFO L129 PetriNetUnfolder]: 125/472 cut-off events. [2020-10-11 18:15:44,266 INFO L130 PetriNetUnfolder]: For 1230/1526 co-relation queries the response was YES. [2020-10-11 18:15:44,268 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1488 conditions, 472 events. 125/472 cut-off events. For 1230/1526 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2569 event pairs, 0 based on Foata normal form. 77/523 useless extension candidates. Maximal degree in co-relation 1465. Up to 153 conditions per place. [2020-10-11 18:15:44,270 INFO L132 encePairwiseOnDemand]: 100/110 looper letters, 4 selfloop transitions, 19 changer transitions 16/120 dead transitions. [2020-10-11 18:15:44,270 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 120 transitions, 563 flow [2020-10-11 18:15:44,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:15:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:15:44,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1192 transitions. [2020-10-11 18:15:44,274 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9030303030303031 [2020-10-11 18:15:44,274 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1192 transitions. [2020-10-11 18:15:44,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1192 transitions. [2020-10-11 18:15:44,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:15:44,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1192 transitions. [2020-10-11 18:15:44,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:15:44,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:15:44,281 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:15:44,281 INFO L185 Difference]: Start difference. First operand has 127 places, 105 transitions, 364 flow. Second operand 12 states and 1192 transitions. [2020-10-11 18:15:44,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 120 transitions, 563 flow [2020-10-11 18:15:44,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 120 transitions, 514 flow, removed 23 selfloop flow, removed 8 redundant places. [2020-10-11 18:15:44,286 INFO L241 Difference]: Finished difference. Result has 133 places, 104 transitions, 388 flow [2020-10-11 18:15:44,287 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=388, PETRI_PLACES=133, PETRI_TRANSITIONS=104} [2020-10-11 18:15:44,287 INFO L341 CegarLoopForPetriNet]: 117 programPoint places, 16 predicate places. [2020-10-11 18:15:44,287 INFO L481 AbstractCegarLoop]: Abstraction has has 133 places, 104 transitions, 388 flow [2020-10-11 18:15:44,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:15:44,287 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:15:44,288 INFO L255 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] [2020-10-11 18:15:44,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:15:44,288 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:15:44,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:15:44,288 INFO L82 PathProgramCache]: Analyzing trace with hash 709992710, now seen corresponding path program 1 times [2020-10-11 18:15:44,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:15:44,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438226168] [2020-10-11 18:15:44,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:15:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:15:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:15:44,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438226168] [2020-10-11 18:15:44,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:15:44,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:15:44,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019384487] [2020-10-11 18:15:44,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:15:44,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:15:44,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:15:44,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:15:44,629 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 110 [2020-10-11 18:15:44,630 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 104 transitions, 388 flow. Second operand 6 states. [2020-10-11 18:15:44,630 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:15:44,630 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 110 [2020-10-11 18:15:44,630 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:15:44,769 INFO L129 PetriNetUnfolder]: 82/405 cut-off events. [2020-10-11 18:15:44,769 INFO L130 PetriNetUnfolder]: For 505/580 co-relation queries the response was YES. [2020-10-11 18:15:44,772 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 405 events. 82/405 cut-off events. For 505/580 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2136 event pairs, 0 based on Foata normal form. 1/377 useless extension candidates. Maximal degree in co-relation 980. Up to 81 conditions per place. [2020-10-11 18:15:44,774 INFO L132 encePairwiseOnDemand]: 104/110 looper letters, 7 selfloop transitions, 2 changer transitions 5/109 dead transitions. [2020-10-11 18:15:44,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 109 transitions, 430 flow [2020-10-11 18:15:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 18:15:44,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-11 18:15:44,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 609 transitions. [2020-10-11 18:15:44,777 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9227272727272727 [2020-10-11 18:15:44,777 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 609 transitions. [2020-10-11 18:15:44,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 609 transitions. [2020-10-11 18:15:44,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:15:44,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 609 transitions. [2020-10-11 18:15:44,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-11 18:15:44,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-11 18:15:44,783 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-11 18:15:44,783 INFO L185 Difference]: Start difference. First operand has 133 places, 104 transitions, 388 flow. Second operand 6 states and 609 transitions. [2020-10-11 18:15:44,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 109 transitions, 430 flow [2020-10-11 18:15:44,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 109 transitions, 310 flow, removed 28 selfloop flow, removed 18 redundant places. [2020-10-11 18:15:44,791 INFO L241 Difference]: Finished difference. Result has 119 places, 104 transitions, 284 flow [2020-10-11 18:15:44,792 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=284, PETRI_PLACES=119, PETRI_TRANSITIONS=104} [2020-10-11 18:15:44,792 INFO L341 CegarLoopForPetriNet]: 117 programPoint places, 2 predicate places. [2020-10-11 18:15:44,792 INFO L481 AbstractCegarLoop]: Abstraction has has 119 places, 104 transitions, 284 flow [2020-10-11 18:15:44,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:15:44,793 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:15:44,793 INFO L255 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] [2020-10-11 18:15:44,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:15:44,794 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:15:44,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:15:44,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1314710676, now seen corresponding path program 2 times [2020-10-11 18:15:44,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:15:44,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630331357] [2020-10-11 18:15:44,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:15:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:15:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:15:45,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630331357] [2020-10-11 18:15:45,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:15:45,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:15:45,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319738046] [2020-10-11 18:15:45,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:15:45,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:15:45,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:15:45,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:15:45,590 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 110 [2020-10-11 18:15:45,591 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 104 transitions, 284 flow. Second operand 8 states. [2020-10-11 18:15:45,591 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:15:45,591 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 110 [2020-10-11 18:15:45,591 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:15:45,812 INFO L129 PetriNetUnfolder]: 126/589 cut-off events. [2020-10-11 18:15:45,813 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-11 18:15:45,815 INFO L80 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 589 events. 126/589 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3686 event pairs, 2 based on Foata normal form. 1/548 useless extension candidates. Maximal degree in co-relation 910. Up to 102 conditions per place. [2020-10-11 18:15:45,817 INFO L132 encePairwiseOnDemand]: 102/110 looper letters, 15 selfloop transitions, 7 changer transitions 5/115 dead transitions. [2020-10-11 18:15:45,817 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 115 transitions, 368 flow [2020-10-11 18:15:45,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:15:45,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:15:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 847 transitions. [2020-10-11 18:15:45,820 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8555555555555555 [2020-10-11 18:15:45,820 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 847 transitions. [2020-10-11 18:15:45,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 847 transitions. [2020-10-11 18:15:45,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:15:45,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 847 transitions. [2020-10-11 18:15:45,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:15:45,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:15:45,825 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:15:45,825 INFO L185 Difference]: Start difference. First operand has 119 places, 104 transitions, 284 flow. Second operand 9 states and 847 transitions. [2020-10-11 18:15:45,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 115 transitions, 368 flow [2020-10-11 18:15:45,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 115 transitions, 350 flow, removed 7 selfloop flow, removed 5 redundant places. [2020-10-11 18:15:45,829 INFO L241 Difference]: Finished difference. Result has 124 places, 110 transitions, 317 flow [2020-10-11 18:15:45,829 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=317, PETRI_PLACES=124, PETRI_TRANSITIONS=110} [2020-10-11 18:15:45,830 INFO L341 CegarLoopForPetriNet]: 117 programPoint places, 7 predicate places. [2020-10-11 18:15:45,830 INFO L481 AbstractCegarLoop]: Abstraction has has 124 places, 110 transitions, 317 flow [2020-10-11 18:15:45,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:15:45,830 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:15:45,830 INFO L255 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] [2020-10-11 18:15:45,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:15:45,830 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:15:45,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:15:45,831 INFO L82 PathProgramCache]: Analyzing trace with hash 439218116, now seen corresponding path program 3 times [2020-10-11 18:15:45,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:15:45,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423821859] [2020-10-11 18:15:45,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:15:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:15:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:15:46,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423821859] [2020-10-11 18:15:46,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:15:46,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:15:46,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156464324] [2020-10-11 18:15:46,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:15:46,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:15:46,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:15:46,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:15:47,488 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 110 [2020-10-11 18:15:47,490 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 110 transitions, 317 flow. Second operand 11 states. [2020-10-11 18:15:47,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:15:47,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 110 [2020-10-11 18:15:47,490 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:15:47,842 INFO L129 PetriNetUnfolder]: 163/732 cut-off events. [2020-10-11 18:15:47,842 INFO L130 PetriNetUnfolder]: For 36/67 co-relation queries the response was YES. [2020-10-11 18:15:47,848 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 732 events. 163/732 cut-off events. For 36/67 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4991 event pairs, 2 based on Foata normal form. 17/700 useless extension candidates. Maximal degree in co-relation 1164. Up to 124 conditions per place. [2020-10-11 18:15:47,849 INFO L132 encePairwiseOnDemand]: 100/110 looper letters, 15 selfloop transitions, 6 changer transitions 14/119 dead transitions. [2020-10-11 18:15:47,849 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 119 transitions, 415 flow [2020-10-11 18:15:47,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:15:47,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:15:47,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1010 transitions. [2020-10-11 18:15:47,855 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8347107438016529 [2020-10-11 18:15:47,855 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1010 transitions. [2020-10-11 18:15:47,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1010 transitions. [2020-10-11 18:15:47,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:15:47,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1010 transitions. [2020-10-11 18:15:47,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:15:47,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:15:47,862 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:15:47,862 INFO L185 Difference]: Start difference. First operand has 124 places, 110 transitions, 317 flow. Second operand 11 states and 1010 transitions. [2020-10-11 18:15:47,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 119 transitions, 415 flow [2020-10-11 18:15:47,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 119 transitions, 405 flow, removed 5 selfloop flow, removed 3 redundant places. [2020-10-11 18:15:47,867 INFO L241 Difference]: Finished difference. Result has 135 places, 105 transitions, 318 flow [2020-10-11 18:15:47,867 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=318, PETRI_PLACES=135, PETRI_TRANSITIONS=105} [2020-10-11 18:15:47,867 INFO L341 CegarLoopForPetriNet]: 117 programPoint places, 18 predicate places. [2020-10-11 18:15:47,868 INFO L481 AbstractCegarLoop]: Abstraction has has 135 places, 105 transitions, 318 flow [2020-10-11 18:15:47,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:15:47,868 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:15:47,868 INFO L255 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] [2020-10-11 18:15:47,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:15:47,868 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:15:47,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:15:47,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1157819690, now seen corresponding path program 4 times [2020-10-11 18:15:47,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:15:47,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069053881] [2020-10-11 18:15:47,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:15:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:15:47,944 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:15:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:15:48,012 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:15:48,095 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:15:48,095 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:15:48,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:15:48,162 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,162 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,164 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,164 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,164 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,164 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,164 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,165 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,165 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,165 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,165 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,165 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,166 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,166 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,166 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,166 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,166 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,166 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,167 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,167 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,167 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,167 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,167 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,167 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,167 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,168 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,168 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,168 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,168 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,168 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,169 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,169 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,169 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,169 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,169 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,169 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,170 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,170 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,170 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,170 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,171 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,171 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,171 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,171 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,171 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,171 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,171 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,172 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,173 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,173 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,173 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,173 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,173 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,173 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,174 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,174 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:15:48,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:15:48,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:15:48 BasicIcfg [2020-10-11 18:15:48,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:15:48,338 INFO L168 Benchmark]: Toolchain (without parser) took 13264.00 ms. Allocated memory was 252.2 MB in the beginning and 564.1 MB in the end (delta: 312.0 MB). Free memory was 207.3 MB in the beginning and 484.2 MB in the end (delta: -276.9 MB). Peak memory consumption was 357.0 MB. Max. memory is 14.2 GB. [2020-10-11 18:15:48,339 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:15:48,340 INFO L168 Benchmark]: CACSL2BoogieTranslator took 799.84 ms. Allocated memory was 252.2 MB in the beginning and 316.1 MB in the end (delta: 64.0 MB). Free memory was 207.3 MB in the beginning and 261.7 MB in the end (delta: -54.4 MB). Peak memory consumption was 27.0 MB. Max. memory is 14.2 GB. [2020-10-11 18:15:48,344 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.81 ms. Allocated memory is still 316.1 MB. Free memory was 261.7 MB in the beginning and 259.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:15:48,346 INFO L168 Benchmark]: Boogie Preprocessor took 41.63 ms. Allocated memory is still 316.1 MB. Free memory was 259.2 MB in the beginning and 256.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:15:48,347 INFO L168 Benchmark]: RCFGBuilder took 2059.08 ms. Allocated memory was 316.1 MB in the beginning and 360.2 MB in the end (delta: 44.0 MB). Free memory was 256.7 MB in the beginning and 204.2 MB in the end (delta: 52.5 MB). Peak memory consumption was 96.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:15:48,351 INFO L168 Benchmark]: TraceAbstraction took 10292.24 ms. Allocated memory was 360.2 MB in the beginning and 564.1 MB in the end (delta: 203.9 MB). Free memory was 204.2 MB in the beginning and 484.2 MB in the end (delta: -280.0 MB). Peak memory consumption was 245.9 MB. Max. memory is 14.2 GB. [2020-10-11 18:15:48,358 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 799.84 ms. Allocated memory was 252.2 MB in the beginning and 316.1 MB in the end (delta: 64.0 MB). Free memory was 207.3 MB in the beginning and 261.7 MB in the end (delta: -54.4 MB). Peak memory consumption was 27.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 62.81 ms. Allocated memory is still 316.1 MB. Free memory was 261.7 MB in the beginning and 259.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 41.63 ms. Allocated memory is still 316.1 MB. Free memory was 259.2 MB in the beginning and 256.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2059.08 ms. Allocated memory was 316.1 MB in the beginning and 360.2 MB in the end (delta: 44.0 MB). Free memory was 256.7 MB in the beginning and 204.2 MB in the end (delta: 52.5 MB). Peak memory consumption was 96.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 10292.24 ms. Allocated memory was 360.2 MB in the beginning and 564.1 MB in the end (delta: 203.9 MB). Free memory was 204.2 MB in the beginning and 484.2 MB in the end (delta: -280.0 MB). Peak memory consumption was 245.9 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L705] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L707] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L708] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L709] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L711] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L713] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L714] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L715] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L716] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L717] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L718] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L719] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L720] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L721] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L722] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L723] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L724] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L725] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L726] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L727] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L728] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L729] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L730] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L731] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] 0 pthread_t t717; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t717, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] 0 pthread_t t718; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t718, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] 0 pthread_t t719; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t719, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] 0 pthread_t t720; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] FCALL, FORK 0 pthread_create(&t720, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 1 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L792] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L815] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L739] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L758] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L759] 2 y$flush_delayed = weak$$choice2 [L760] 2 y$mem_tmp = y [L761] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L761] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L762] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L762] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L762] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L763] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L763] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L763] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L763] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L764] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L764] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L764] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L765] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L766] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L766] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L766] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L767] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L767] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 __unbuffered_p1_EAX = y [L769] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L769] 2 y = y$flush_delayed ? y$mem_tmp : y [L770] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=9, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=9, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L798] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L798] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L800] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L801] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L802] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=9, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L821] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L821] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L822] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L823] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L824] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L825] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L828] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=9, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=9, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=9, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L860] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L863] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=9, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=9, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=9, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 109 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 9.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 301 SDtfs, 372 SDslu, 1275 SDs, 0 SdLazy, 1201 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=442occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 940 NumberOfCodeBlocks, 940 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 846 ConstructedInterpolants, 0 QuantifiedInterpolants, 195447 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...