/usr/bin/java -Xmx8000000000 -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/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:26:55,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:26:55,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:26:55,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:26:55,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:26:55,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:26:55,824 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:26:55,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:26:55,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:26:55,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:26:55,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:26:55,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:26:55,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:26:55,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:26:55,832 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:26:55,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:26:55,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:26:55,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:26:55,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:26:55,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:26:55,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:26:55,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:26:55,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:26:55,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:26:55,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:26:55,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:26:55,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:26:55,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:26:55,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:26:55,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:26:55,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:26:55,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:26:55,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:26:55,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:26:55,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:26:55,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:26:55,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:26:55,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:26:55,867 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:26:55,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:26:55,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:26:55,872 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:26:55,896 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:26:55,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:26:55,899 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:26:55,899 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:26:55,899 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:26:55,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:26:55,900 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:26:55,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:26:55,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:26:55,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:26:55,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:26:55,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:26:55,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:26:55,902 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:26:55,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:26:55,903 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:26:55,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:26:55,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:26:55,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:26:55,903 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:26:55,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:26:55,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:26:55,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:26:55,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:26:55,905 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:26:55,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:26:55,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:26:55,905 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:26:55,906 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:26:55,906 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:26:56,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:26:56,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:26:56,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:26:56,185 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:26:56,185 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:26:56,187 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.opt.i [2019-12-18 20:26:56,257 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d327d8f2/200d0d670b4a4f9d9147842f37a10d0b/FLAG3a15f59fa [2019-12-18 20:26:56,867 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:26:56,867 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_pso.opt.i [2019-12-18 20:26:56,882 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d327d8f2/200d0d670b4a4f9d9147842f37a10d0b/FLAG3a15f59fa [2019-12-18 20:26:57,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d327d8f2/200d0d670b4a4f9d9147842f37a10d0b [2019-12-18 20:26:57,115 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:26:57,117 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:26:57,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:26:57,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:26:57,122 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:26:57,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:26:57" (1/1) ... [2019-12-18 20:26:57,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e5dfff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:57, skipping insertion in model container [2019-12-18 20:26:57,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:26:57" (1/1) ... [2019-12-18 20:26:57,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:26:57,197 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:26:57,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:26:57,790 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:26:57,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:26:57,940 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:26:57,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:57 WrapperNode [2019-12-18 20:26:57,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:26:57,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:26:57,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:26:57,942 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:26:57,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:57" (1/1) ... [2019-12-18 20:26:57,982 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:57" (1/1) ... [2019-12-18 20:26:58,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:26:58,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:26:58,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:26:58,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:26:58,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:57" (1/1) ... [2019-12-18 20:26:58,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:57" (1/1) ... [2019-12-18 20:26:58,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:57" (1/1) ... [2019-12-18 20:26:58,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:57" (1/1) ... [2019-12-18 20:26:58,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:57" (1/1) ... [2019-12-18 20:26:58,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:57" (1/1) ... [2019-12-18 20:26:58,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:57" (1/1) ... [2019-12-18 20:26:58,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:26:58,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:26:58,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:26:58,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:26:58,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:57" (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 [2019-12-18 20:26:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:26:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:26:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:26:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:26:58,148 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:26:58,148 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:26:58,148 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:26:58,148 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:26:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:26:58,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:26:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:26:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:26:58,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:26:58,152 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:26:59,082 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:26:59,083 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:26:59,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:26:59 BoogieIcfgContainer [2019-12-18 20:26:59,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:26:59,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:26:59,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:26:59,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:26:59,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:26:57" (1/3) ... [2019-12-18 20:26:59,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79057532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:26:59, skipping insertion in model container [2019-12-18 20:26:59,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:57" (2/3) ... [2019-12-18 20:26:59,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79057532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:26:59, skipping insertion in model container [2019-12-18 20:26:59,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:26:59" (3/3) ... [2019-12-18 20:26:59,108 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_pso.opt.i [2019-12-18 20:26:59,118 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:26:59,118 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:26:59,126 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:26:59,127 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:26:59,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,168 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,168 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,171 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,172 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,192 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,192 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,193 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,193 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,193 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,221 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,222 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,224 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,230 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,230 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,234 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,236 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:59,252 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:26:59,272 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:26:59,273 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:26:59,273 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:26:59,273 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:26:59,273 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:26:59,273 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:26:59,273 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:26:59,274 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:26:59,292 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 241 transitions [2019-12-18 20:26:59,294 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-18 20:26:59,396 INFO L126 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-18 20:26:59,396 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:26:59,422 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 563 event pairs. 9/189 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 20:26:59,459 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-18 20:26:59,519 INFO L126 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-18 20:26:59,519 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:26:59,530 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 563 event pairs. 9/189 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 20:26:59,563 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-18 20:26:59,564 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:27:02,930 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-12-18 20:27:03,215 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 20:27:03,358 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 20:27:03,391 INFO L206 etLargeBlockEncoding]: Checked pairs total: 150396 [2019-12-18 20:27:03,391 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-18 20:27:03,394 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 135 transitions [2019-12-18 20:27:08,062 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 51230 states. [2019-12-18 20:27:08,064 INFO L276 IsEmpty]: Start isEmpty. Operand 51230 states. [2019-12-18 20:27:08,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 20:27:08,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:08,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:27:08,071 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:08,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:08,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1919545255, now seen corresponding path program 1 times [2019-12-18 20:27:08,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:08,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725385616] [2019-12-18 20:27:08,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:27:08,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725385616] [2019-12-18 20:27:08,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:08,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:27:08,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643918682] [2019-12-18 20:27:08,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:27:08,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:08,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:27:08,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:27:08,371 INFO L87 Difference]: Start difference. First operand 51230 states. Second operand 3 states. [2019-12-18 20:27:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:09,401 INFO L93 Difference]: Finished difference Result 50670 states and 205792 transitions. [2019-12-18 20:27:09,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:27:09,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 20:27:09,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:09,768 INFO L225 Difference]: With dead ends: 50670 [2019-12-18 20:27:09,768 INFO L226 Difference]: Without dead ends: 47174 [2019-12-18 20:27:09,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:27:12,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47174 states. [2019-12-18 20:27:13,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47174 to 47174. [2019-12-18 20:27:13,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47174 states. [2019-12-18 20:27:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47174 states to 47174 states and 191464 transitions. [2019-12-18 20:27:14,023 INFO L78 Accepts]: Start accepts. Automaton has 47174 states and 191464 transitions. Word has length 7 [2019-12-18 20:27:14,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:14,024 INFO L462 AbstractCegarLoop]: Abstraction has 47174 states and 191464 transitions. [2019-12-18 20:27:14,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:27:14,024 INFO L276 IsEmpty]: Start isEmpty. Operand 47174 states and 191464 transitions. [2019-12-18 20:27:14,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:27:14,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:14,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:27:14,036 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:14,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:14,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1688254996, now seen corresponding path program 1 times [2019-12-18 20:27:14,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:14,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808569538] [2019-12-18 20:27:14,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:27:14,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808569538] [2019-12-18 20:27:14,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:14,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:27:14,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135905743] [2019-12-18 20:27:14,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:27:14,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:14,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:27:14,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:27:14,260 INFO L87 Difference]: Start difference. First operand 47174 states and 191464 transitions. Second operand 4 states. [2019-12-18 20:27:15,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:15,086 INFO L93 Difference]: Finished difference Result 74790 states and 291766 transitions. [2019-12-18 20:27:15,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:27:15,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 20:27:15,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:17,761 INFO L225 Difference]: With dead ends: 74790 [2019-12-18 20:27:17,762 INFO L226 Difference]: Without dead ends: 74754 [2019-12-18 20:27:17,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:27:18,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74754 states. [2019-12-18 20:27:20,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74754 to 72654. [2019-12-18 20:27:20,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72654 states. [2019-12-18 20:27:20,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72654 states to 72654 states and 285192 transitions. [2019-12-18 20:27:20,407 INFO L78 Accepts]: Start accepts. Automaton has 72654 states and 285192 transitions. Word has length 13 [2019-12-18 20:27:20,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:20,407 INFO L462 AbstractCegarLoop]: Abstraction has 72654 states and 285192 transitions. [2019-12-18 20:27:20,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:27:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 72654 states and 285192 transitions. [2019-12-18 20:27:20,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:27:20,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:20,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:27:20,413 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:20,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:20,413 INFO L82 PathProgramCache]: Analyzing trace with hash -955457127, now seen corresponding path program 1 times [2019-12-18 20:27:20,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:20,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163502889] [2019-12-18 20:27:20,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:27:20,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163502889] [2019-12-18 20:27:20,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:20,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:27:20,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240135459] [2019-12-18 20:27:20,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:27:20,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:20,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:27:20,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:27:20,497 INFO L87 Difference]: Start difference. First operand 72654 states and 285192 transitions. Second operand 4 states. [2019-12-18 20:27:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:23,421 INFO L93 Difference]: Finished difference Result 91098 states and 353264 transitions. [2019-12-18 20:27:23,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:27:23,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:27:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:23,859 INFO L225 Difference]: With dead ends: 91098 [2019-12-18 20:27:23,859 INFO L226 Difference]: Without dead ends: 91070 [2019-12-18 20:27:23,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:27:25,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91070 states. [2019-12-18 20:27:26,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91070 to 82226. [2019-12-18 20:27:26,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82226 states. [2019-12-18 20:27:26,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82226 states to 82226 states and 321384 transitions. [2019-12-18 20:27:26,947 INFO L78 Accepts]: Start accepts. Automaton has 82226 states and 321384 transitions. Word has length 16 [2019-12-18 20:27:26,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:26,947 INFO L462 AbstractCegarLoop]: Abstraction has 82226 states and 321384 transitions. [2019-12-18 20:27:26,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:27:26,947 INFO L276 IsEmpty]: Start isEmpty. Operand 82226 states and 321384 transitions. [2019-12-18 20:27:26,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 20:27:26,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:26,955 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:27:26,955 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:26,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:26,955 INFO L82 PathProgramCache]: Analyzing trace with hash 445629712, now seen corresponding path program 1 times [2019-12-18 20:27:26,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:26,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80404690] [2019-12-18 20:27:26,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:27,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:27:27,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80404690] [2019-12-18 20:27:27,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:27,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:27:27,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562857275] [2019-12-18 20:27:27,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:27:27,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:27,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:27:27,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:27:27,010 INFO L87 Difference]: Start difference. First operand 82226 states and 321384 transitions. Second operand 3 states. [2019-12-18 20:27:30,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:30,241 INFO L93 Difference]: Finished difference Result 136104 states and 511737 transitions. [2019-12-18 20:27:30,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:27:30,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 20:27:30,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:30,681 INFO L225 Difference]: With dead ends: 136104 [2019-12-18 20:27:30,681 INFO L226 Difference]: Without dead ends: 136104 [2019-12-18 20:27:30,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:27:32,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136104 states. [2019-12-18 20:27:36,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136104 to 120690. [2019-12-18 20:27:36,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120690 states. [2019-12-18 20:27:37,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120690 states to 120690 states and 460184 transitions. [2019-12-18 20:27:37,230 INFO L78 Accepts]: Start accepts. Automaton has 120690 states and 460184 transitions. Word has length 17 [2019-12-18 20:27:37,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:37,230 INFO L462 AbstractCegarLoop]: Abstraction has 120690 states and 460184 transitions. [2019-12-18 20:27:37,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:27:37,231 INFO L276 IsEmpty]: Start isEmpty. Operand 120690 states and 460184 transitions. [2019-12-18 20:27:37,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 20:27:37,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:37,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:27:37,240 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:37,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:37,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1411633095, now seen corresponding path program 1 times [2019-12-18 20:27:37,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:37,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635920911] [2019-12-18 20:27:37,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:27:37,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635920911] [2019-12-18 20:27:37,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:37,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:27:37,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053742854] [2019-12-18 20:27:37,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:27:37,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:37,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:27:37,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:27:37,297 INFO L87 Difference]: Start difference. First operand 120690 states and 460184 transitions. Second operand 3 states. [2019-12-18 20:27:38,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:38,796 INFO L93 Difference]: Finished difference Result 113712 states and 433065 transitions. [2019-12-18 20:27:38,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:27:38,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 20:27:38,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:39,119 INFO L225 Difference]: With dead ends: 113712 [2019-12-18 20:27:39,119 INFO L226 Difference]: Without dead ends: 113042 [2019-12-18 20:27:39,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:27:40,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113042 states. [2019-12-18 20:27:46,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113042 to 113042. [2019-12-18 20:27:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113042 states. [2019-12-18 20:27:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113042 states to 113042 states and 430688 transitions. [2019-12-18 20:27:46,397 INFO L78 Accepts]: Start accepts. Automaton has 113042 states and 430688 transitions. Word has length 18 [2019-12-18 20:27:46,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:46,397 INFO L462 AbstractCegarLoop]: Abstraction has 113042 states and 430688 transitions. [2019-12-18 20:27:46,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:27:46,397 INFO L276 IsEmpty]: Start isEmpty. Operand 113042 states and 430688 transitions. [2019-12-18 20:27:46,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 20:27:46,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:46,412 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:27:46,412 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:46,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:46,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1103080662, now seen corresponding path program 1 times [2019-12-18 20:27:46,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:46,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163693966] [2019-12-18 20:27:46,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:46,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:27:46,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163693966] [2019-12-18 20:27:46,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:46,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:27:46,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991121377] [2019-12-18 20:27:46,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:27:46,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:46,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:27:46,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:27:46,489 INFO L87 Difference]: Start difference. First operand 113042 states and 430688 transitions. Second operand 4 states. [2019-12-18 20:27:48,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:48,253 INFO L93 Difference]: Finished difference Result 137854 states and 518994 transitions. [2019-12-18 20:27:48,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:27:48,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 20:27:48,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:48,625 INFO L225 Difference]: With dead ends: 137854 [2019-12-18 20:27:48,625 INFO L226 Difference]: Without dead ends: 137820 [2019-12-18 20:27:48,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:27:54,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137820 states. [2019-12-18 20:27:55,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137820 to 114370. [2019-12-18 20:27:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114370 states. [2019-12-18 20:27:56,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114370 states to 114370 states and 435718 transitions. [2019-12-18 20:27:56,343 INFO L78 Accepts]: Start accepts. Automaton has 114370 states and 435718 transitions. Word has length 19 [2019-12-18 20:27:56,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:56,343 INFO L462 AbstractCegarLoop]: Abstraction has 114370 states and 435718 transitions. [2019-12-18 20:27:56,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:27:56,343 INFO L276 IsEmpty]: Start isEmpty. Operand 114370 states and 435718 transitions. [2019-12-18 20:27:56,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:27:56,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:56,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:27:56,365 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:56,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:56,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1142959004, now seen corresponding path program 1 times [2019-12-18 20:27:56,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:56,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898687538] [2019-12-18 20:27:56,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:27:56,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898687538] [2019-12-18 20:27:56,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:56,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:27:56,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860463326] [2019-12-18 20:27:56,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:27:56,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:56,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:27:56,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:27:56,464 INFO L87 Difference]: Start difference. First operand 114370 states and 435718 transitions. Second operand 4 states. [2019-12-18 20:27:56,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:56,778 INFO L93 Difference]: Finished difference Result 70614 states and 234066 transitions. [2019-12-18 20:27:56,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:27:56,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-18 20:27:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:56,902 INFO L225 Difference]: With dead ends: 70614 [2019-12-18 20:27:56,903 INFO L226 Difference]: Without dead ends: 63026 [2019-12-18 20:27:56,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:27:58,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63026 states. [2019-12-18 20:27:59,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63026 to 63026. [2019-12-18 20:27:59,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63026 states. [2019-12-18 20:27:59,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63026 states to 63026 states and 208839 transitions. [2019-12-18 20:27:59,246 INFO L78 Accepts]: Start accepts. Automaton has 63026 states and 208839 transitions. Word has length 22 [2019-12-18 20:27:59,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:59,247 INFO L462 AbstractCegarLoop]: Abstraction has 63026 states and 208839 transitions. [2019-12-18 20:27:59,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:27:59,247 INFO L276 IsEmpty]: Start isEmpty. Operand 63026 states and 208839 transitions. [2019-12-18 20:27:59,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 20:27:59,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:59,263 INFO L411 BasicCegarLoop]: 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] [2019-12-18 20:27:59,263 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:59,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:59,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1703543737, now seen corresponding path program 1 times [2019-12-18 20:27:59,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:59,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355877233] [2019-12-18 20:27:59,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:59,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:27:59,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355877233] [2019-12-18 20:27:59,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:59,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:27:59,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108347793] [2019-12-18 20:27:59,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:27:59,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:59,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:27:59,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:27:59,347 INFO L87 Difference]: Start difference. First operand 63026 states and 208839 transitions. Second operand 5 states. [2019-12-18 20:28:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:02,465 INFO L93 Difference]: Finished difference Result 88433 states and 285898 transitions. [2019-12-18 20:28:02,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:28:02,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-18 20:28:02,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:02,639 INFO L225 Difference]: With dead ends: 88433 [2019-12-18 20:28:02,640 INFO L226 Difference]: Without dead ends: 88418 [2019-12-18 20:28:02,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:28:03,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88418 states. [2019-12-18 20:28:04,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88418 to 68978. [2019-12-18 20:28:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68978 states. [2019-12-18 20:28:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68978 states to 68978 states and 227454 transitions. [2019-12-18 20:28:04,619 INFO L78 Accepts]: Start accepts. Automaton has 68978 states and 227454 transitions. Word has length 23 [2019-12-18 20:28:04,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:04,620 INFO L462 AbstractCegarLoop]: Abstraction has 68978 states and 227454 transitions. [2019-12-18 20:28:04,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:28:04,620 INFO L276 IsEmpty]: Start isEmpty. Operand 68978 states and 227454 transitions. [2019-12-18 20:28:04,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 20:28:04,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:04,643 INFO L411 BasicCegarLoop]: 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] [2019-12-18 20:28:04,643 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:04,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:04,643 INFO L82 PathProgramCache]: Analyzing trace with hash 800773514, now seen corresponding path program 1 times [2019-12-18 20:28:04,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:04,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394887842] [2019-12-18 20:28:04,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:04,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394887842] [2019-12-18 20:28:04,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:04,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:28:04,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155380415] [2019-12-18 20:28:04,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:28:04,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:04,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:28:04,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:28:04,717 INFO L87 Difference]: Start difference. First operand 68978 states and 227454 transitions. Second operand 5 states. [2019-12-18 20:28:04,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:04,830 INFO L93 Difference]: Finished difference Result 16757 states and 48028 transitions. [2019-12-18 20:28:04,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:28:04,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 20:28:04,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:04,849 INFO L225 Difference]: With dead ends: 16757 [2019-12-18 20:28:04,850 INFO L226 Difference]: Without dead ends: 11901 [2019-12-18 20:28:04,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:28:04,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11901 states. [2019-12-18 20:28:04,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11901 to 11805. [2019-12-18 20:28:04,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11805 states. [2019-12-18 20:28:04,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11805 states to 11805 states and 31958 transitions. [2019-12-18 20:28:04,997 INFO L78 Accepts]: Start accepts. Automaton has 11805 states and 31958 transitions. Word has length 26 [2019-12-18 20:28:04,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:04,998 INFO L462 AbstractCegarLoop]: Abstraction has 11805 states and 31958 transitions. [2019-12-18 20:28:04,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:28:04,998 INFO L276 IsEmpty]: Start isEmpty. Operand 11805 states and 31958 transitions. [2019-12-18 20:28:05,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 20:28:05,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:05,008 INFO L411 BasicCegarLoop]: 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] [2019-12-18 20:28:05,008 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:05,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:05,009 INFO L82 PathProgramCache]: Analyzing trace with hash 595173251, now seen corresponding path program 1 times [2019-12-18 20:28:05,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:05,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163536696] [2019-12-18 20:28:05,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:05,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163536696] [2019-12-18 20:28:05,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:05,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:28:05,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999031784] [2019-12-18 20:28:05,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:28:05,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:05,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:28:05,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:28:05,051 INFO L87 Difference]: Start difference. First operand 11805 states and 31958 transitions. Second operand 3 states. [2019-12-18 20:28:05,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:05,143 INFO L93 Difference]: Finished difference Result 12730 states and 32658 transitions. [2019-12-18 20:28:05,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:28:05,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-18 20:28:05,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:05,158 INFO L225 Difference]: With dead ends: 12730 [2019-12-18 20:28:05,159 INFO L226 Difference]: Without dead ends: 12730 [2019-12-18 20:28:05,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:28:05,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12730 states. [2019-12-18 20:28:05,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12730 to 11936. [2019-12-18 20:28:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11936 states. [2019-12-18 20:28:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11936 states to 11936 states and 30841 transitions. [2019-12-18 20:28:05,305 INFO L78 Accepts]: Start accepts. Automaton has 11936 states and 30841 transitions. Word has length 34 [2019-12-18 20:28:05,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:05,306 INFO L462 AbstractCegarLoop]: Abstraction has 11936 states and 30841 transitions. [2019-12-18 20:28:05,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:28:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 11936 states and 30841 transitions. [2019-12-18 20:28:05,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 20:28:05,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:05,316 INFO L411 BasicCegarLoop]: 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] [2019-12-18 20:28:05,317 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:05,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:05,317 INFO L82 PathProgramCache]: Analyzing trace with hash 2128004174, now seen corresponding path program 1 times [2019-12-18 20:28:05,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:05,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163248705] [2019-12-18 20:28:05,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:05,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163248705] [2019-12-18 20:28:05,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:05,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:28:05,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742173377] [2019-12-18 20:28:05,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:28:05,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:05,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:28:05,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:28:05,401 INFO L87 Difference]: Start difference. First operand 11936 states and 30841 transitions. Second operand 6 states. [2019-12-18 20:28:05,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:05,516 INFO L93 Difference]: Finished difference Result 9592 states and 25585 transitions. [2019-12-18 20:28:05,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:28:05,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-18 20:28:05,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:05,534 INFO L225 Difference]: With dead ends: 9592 [2019-12-18 20:28:05,535 INFO L226 Difference]: Without dead ends: 9305 [2019-12-18 20:28:05,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:28:05,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9305 states. [2019-12-18 20:28:05,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9305 to 7879. [2019-12-18 20:28:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7879 states. [2019-12-18 20:28:05,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7879 states to 7879 states and 21531 transitions. [2019-12-18 20:28:05,701 INFO L78 Accepts]: Start accepts. Automaton has 7879 states and 21531 transitions. Word has length 37 [2019-12-18 20:28:05,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:05,701 INFO L462 AbstractCegarLoop]: Abstraction has 7879 states and 21531 transitions. [2019-12-18 20:28:05,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:28:05,701 INFO L276 IsEmpty]: Start isEmpty. Operand 7879 states and 21531 transitions. [2019-12-18 20:28:05,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-18 20:28:05,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:05,722 INFO L411 BasicCegarLoop]: 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] [2019-12-18 20:28:05,722 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:05,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:05,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1727195497, now seen corresponding path program 1 times [2019-12-18 20:28:05,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:05,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246106074] [2019-12-18 20:28:05,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:05,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:05,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246106074] [2019-12-18 20:28:05,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:05,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:28:05,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966589009] [2019-12-18 20:28:05,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:28:05,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:05,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:28:05,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:28:05,841 INFO L87 Difference]: Start difference. First operand 7879 states and 21531 transitions. Second operand 4 states. [2019-12-18 20:28:06,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:06,068 INFO L93 Difference]: Finished difference Result 8974 states and 23855 transitions. [2019-12-18 20:28:06,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:28:06,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-18 20:28:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:06,081 INFO L225 Difference]: With dead ends: 8974 [2019-12-18 20:28:06,081 INFO L226 Difference]: Without dead ends: 5030 [2019-12-18 20:28:06,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:28:06,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5030 states. [2019-12-18 20:28:06,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5030 to 5030. [2019-12-18 20:28:06,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5030 states. [2019-12-18 20:28:06,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5030 states to 5030 states and 12201 transitions. [2019-12-18 20:28:06,177 INFO L78 Accepts]: Start accepts. Automaton has 5030 states and 12201 transitions. Word has length 61 [2019-12-18 20:28:06,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:06,178 INFO L462 AbstractCegarLoop]: Abstraction has 5030 states and 12201 transitions. [2019-12-18 20:28:06,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:28:06,179 INFO L276 IsEmpty]: Start isEmpty. Operand 5030 states and 12201 transitions. [2019-12-18 20:28:06,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-18 20:28:06,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:06,187 INFO L411 BasicCegarLoop]: 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] [2019-12-18 20:28:06,187 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:06,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:06,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1561359919, now seen corresponding path program 2 times [2019-12-18 20:28:06,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:06,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663695336] [2019-12-18 20:28:06,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:06,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663695336] [2019-12-18 20:28:06,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:06,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:28:06,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199752617] [2019-12-18 20:28:06,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:28:06,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:06,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:28:06,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:28:06,315 INFO L87 Difference]: Start difference. First operand 5030 states and 12201 transitions. Second operand 8 states. [2019-12-18 20:28:06,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:06,765 INFO L93 Difference]: Finished difference Result 10411 states and 25662 transitions. [2019-12-18 20:28:06,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 20:28:06,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2019-12-18 20:28:06,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:06,780 INFO L225 Difference]: With dead ends: 10411 [2019-12-18 20:28:06,780 INFO L226 Difference]: Without dead ends: 8792 [2019-12-18 20:28:06,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-18 20:28:06,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8792 states. [2019-12-18 20:28:06,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8792 to 6527. [2019-12-18 20:28:06,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6527 states. [2019-12-18 20:28:06,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6527 states to 6527 states and 15893 transitions. [2019-12-18 20:28:06,904 INFO L78 Accepts]: Start accepts. Automaton has 6527 states and 15893 transitions. Word has length 61 [2019-12-18 20:28:06,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:06,904 INFO L462 AbstractCegarLoop]: Abstraction has 6527 states and 15893 transitions. [2019-12-18 20:28:06,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:28:06,905 INFO L276 IsEmpty]: Start isEmpty. Operand 6527 states and 15893 transitions. [2019-12-18 20:28:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-18 20:28:06,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:06,911 INFO L411 BasicCegarLoop]: 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] [2019-12-18 20:28:06,911 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:06,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:06,912 INFO L82 PathProgramCache]: Analyzing trace with hash -73216147, now seen corresponding path program 3 times [2019-12-18 20:28:06,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:06,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108651272] [2019-12-18 20:28:06,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:06,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:06,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108651272] [2019-12-18 20:28:06,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:06,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:28:06,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683818248] [2019-12-18 20:28:06,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:28:06,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:06,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:28:06,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:28:06,979 INFO L87 Difference]: Start difference. First operand 6527 states and 15893 transitions. Second operand 4 states. [2019-12-18 20:28:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:07,015 INFO L93 Difference]: Finished difference Result 7113 states and 17133 transitions. [2019-12-18 20:28:07,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:28:07,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-18 20:28:07,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:07,016 INFO L225 Difference]: With dead ends: 7113 [2019-12-18 20:28:07,017 INFO L226 Difference]: Without dead ends: 663 [2019-12-18 20:28:07,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:28:07,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-12-18 20:28:07,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2019-12-18 20:28:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-12-18 20:28:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1354 transitions. [2019-12-18 20:28:07,035 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1354 transitions. Word has length 61 [2019-12-18 20:28:07,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:07,035 INFO L462 AbstractCegarLoop]: Abstraction has 663 states and 1354 transitions. [2019-12-18 20:28:07,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:28:07,035 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1354 transitions. [2019-12-18 20:28:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-18 20:28:07,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:07,036 INFO L411 BasicCegarLoop]: 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] [2019-12-18 20:28:07,037 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:07,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:07,037 INFO L82 PathProgramCache]: Analyzing trace with hash 911720613, now seen corresponding path program 4 times [2019-12-18 20:28:07,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:07,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757727264] [2019-12-18 20:28:07,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:07,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757727264] [2019-12-18 20:28:07,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:07,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:28:07,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605083170] [2019-12-18 20:28:07,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:28:07,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:07,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:28:07,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:28:07,108 INFO L87 Difference]: Start difference. First operand 663 states and 1354 transitions. Second operand 5 states. [2019-12-18 20:28:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:07,165 INFO L93 Difference]: Finished difference Result 1313 states and 2694 transitions. [2019-12-18 20:28:07,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:28:07,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-12-18 20:28:07,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:07,166 INFO L225 Difference]: With dead ends: 1313 [2019-12-18 20:28:07,166 INFO L226 Difference]: Without dead ends: 662 [2019-12-18 20:28:07,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:28:07,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-12-18 20:28:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2019-12-18 20:28:07,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-12-18 20:28:07,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1352 transitions. [2019-12-18 20:28:07,175 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1352 transitions. Word has length 61 [2019-12-18 20:28:07,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:07,176 INFO L462 AbstractCegarLoop]: Abstraction has 662 states and 1352 transitions. [2019-12-18 20:28:07,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:28:07,176 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1352 transitions. [2019-12-18 20:28:07,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 20:28:07,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:07,177 INFO L411 BasicCegarLoop]: 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] [2019-12-18 20:28:07,178 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:07,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:07,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1206977644, now seen corresponding path program 1 times [2019-12-18 20:28:07,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:07,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231748396] [2019-12-18 20:28:07,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:07,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:07,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231748396] [2019-12-18 20:28:07,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:07,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:28:07,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771087655] [2019-12-18 20:28:07,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:28:07,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:07,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:28:07,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:28:07,361 INFO L87 Difference]: Start difference. First operand 662 states and 1352 transitions. Second operand 9 states. [2019-12-18 20:28:07,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:07,995 INFO L93 Difference]: Finished difference Result 1138 states and 2208 transitions. [2019-12-18 20:28:07,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 20:28:07,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-12-18 20:28:07,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:07,997 INFO L225 Difference]: With dead ends: 1138 [2019-12-18 20:28:07,997 INFO L226 Difference]: Without dead ends: 1138 [2019-12-18 20:28:07,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:28:08,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2019-12-18 20:28:08,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 991. [2019-12-18 20:28:08,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-12-18 20:28:08,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1960 transitions. [2019-12-18 20:28:08,008 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1960 transitions. Word has length 62 [2019-12-18 20:28:08,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:08,008 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1960 transitions. [2019-12-18 20:28:08,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:28:08,009 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1960 transitions. [2019-12-18 20:28:08,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 20:28:08,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:08,010 INFO L411 BasicCegarLoop]: 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] [2019-12-18 20:28:08,010 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:08,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:08,011 INFO L82 PathProgramCache]: Analyzing trace with hash -494214102, now seen corresponding path program 2 times [2019-12-18 20:28:08,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:08,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703897860] [2019-12-18 20:28:08,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:08,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703897860] [2019-12-18 20:28:08,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:08,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:28:08,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192784333] [2019-12-18 20:28:08,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:28:08,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:08,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:28:08,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:28:08,109 INFO L87 Difference]: Start difference. First operand 991 states and 1960 transitions. Second operand 6 states. [2019-12-18 20:28:08,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:08,582 INFO L93 Difference]: Finished difference Result 1485 states and 2891 transitions. [2019-12-18 20:28:08,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:28:08,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-18 20:28:08,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:08,585 INFO L225 Difference]: With dead ends: 1485 [2019-12-18 20:28:08,585 INFO L226 Difference]: Without dead ends: 1485 [2019-12-18 20:28:08,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:28:08,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2019-12-18 20:28:08,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1057. [2019-12-18 20:28:08,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2019-12-18 20:28:08,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 2093 transitions. [2019-12-18 20:28:08,597 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 2093 transitions. Word has length 62 [2019-12-18 20:28:08,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:08,597 INFO L462 AbstractCegarLoop]: Abstraction has 1057 states and 2093 transitions. [2019-12-18 20:28:08,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:28:08,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 2093 transitions. [2019-12-18 20:28:08,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 20:28:08,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:08,598 INFO L411 BasicCegarLoop]: 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] [2019-12-18 20:28:08,598 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:08,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:08,599 INFO L82 PathProgramCache]: Analyzing trace with hash -934916524, now seen corresponding path program 3 times [2019-12-18 20:28:08,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:08,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372278924] [2019-12-18 20:28:08,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:08,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372278924] [2019-12-18 20:28:08,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:08,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:28:08,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101939934] [2019-12-18 20:28:08,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:28:08,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:08,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:28:08,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:28:08,669 INFO L87 Difference]: Start difference. First operand 1057 states and 2093 transitions. Second operand 3 states. [2019-12-18 20:28:08,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:08,682 INFO L93 Difference]: Finished difference Result 1057 states and 2092 transitions. [2019-12-18 20:28:08,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:28:08,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-18 20:28:08,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:08,684 INFO L225 Difference]: With dead ends: 1057 [2019-12-18 20:28:08,684 INFO L226 Difference]: Without dead ends: 1057 [2019-12-18 20:28:08,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:28:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-12-18 20:28:08,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 904. [2019-12-18 20:28:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-12-18 20:28:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1810 transitions. [2019-12-18 20:28:08,698 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1810 transitions. Word has length 62 [2019-12-18 20:28:08,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:08,698 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1810 transitions. [2019-12-18 20:28:08,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:28:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1810 transitions. [2019-12-18 20:28:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 20:28:08,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:08,700 INFO L411 BasicCegarLoop]: 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] [2019-12-18 20:28:08,700 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:08,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:08,701 INFO L82 PathProgramCache]: Analyzing trace with hash 997776254, now seen corresponding path program 1 times [2019-12-18 20:28:08,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:08,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956416051] [2019-12-18 20:28:08,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:28:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:28:08,899 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:28:08,899 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:28:08,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= v_~y$r_buff0_thd2~0_52 0) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$read_delayed_var~0.offset_8) (= 0 v_~__unbuffered_p1_EAX~0_15) (= |v_#NULL.offset_7| 0) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 |v_ULTIMATE.start_main_~#t418~0.offset_19|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t418~0.base_26|) (= v_~y$read_delayed~0_8 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t418~0.base_26| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t418~0.base_26|) |v_ULTIMATE.start_main_~#t418~0.offset_19| 0)) |v_#memory_int_17|) (= v_~z~0_10 0) (= v_~y$r_buff0_thd1~0_9 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_34) (= 0 v_~y$r_buff1_thd1~0_10) (= 0 v_~y$w_buff1~0_31) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$r_buff0_thd0~0_22 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t418~0.base_26| 4) |v_#length_21|) (= v_~y$r_buff0_thd3~0_76 0) (= 0 v_~y$r_buff1_thd2~0_28) (= 0 v_~y$w_buff0~0_37) (= 0 v_~y$r_buff1_thd3~0_38) (= 0 |v_#NULL.base_7|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t418~0.base_26|)) (= v_~y$mem_tmp~0_12 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~y$read_delayed_var~0.base_8) (= v_~y$w_buff1_used~0_64 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~x~0_12 0) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t418~0.base_26| 1)) (= 0 v_~y$flush_delayed~0_17) (= v_~y~0_31 0) (= v_~y$w_buff0_used~0_129 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_6|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_~#t418~0.offset=|v_ULTIMATE.start_main_~#t418~0.offset_19|, #NULL.offset=|v_#NULL.offset_7|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_38, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_17, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ULTIMATE.start_main_~#t420~0.base=|v_ULTIMATE.start_main_~#t420~0.base_17|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_11|, ULTIMATE.start_main_~#t420~0.offset=|v_ULTIMATE.start_main_~#t420~0.offset_14|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_21|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_9|, ~y$w_buff1~0=v_~y$w_buff1~0_31, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_12, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_129, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ULTIMATE.start_main_~#t419~0.base=|v_ULTIMATE.start_main_~#t419~0.base_22|, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_76, ~y~0=v_~y~0_31, ULTIMATE.start_main_~#t419~0.offset=|v_ULTIMATE.start_main_~#t419~0.offset_17|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_12|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_9|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_9|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t418~0.base=|v_ULTIMATE.start_main_~#t418~0.base_26|, ~z~0=v_~z~0_10, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t418~0.offset, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t420~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t420~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t419~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t419~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t418~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:28:08,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L830-1-->L832: Formula: (and (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t419~0.base_11|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t419~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t419~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t419~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t419~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t419~0.base_11|) |v_ULTIMATE.start_main_~#t419~0.offset_10| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t419~0.base_11|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t419~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t419~0.base=|v_ULTIMATE.start_main_~#t419~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t419~0.offset=|v_ULTIMATE.start_main_~#t419~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t419~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t419~0.offset] because there is no mapped edge [2019-12-18 20:28:08,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L832-1-->L834: Formula: (and (not (= |v_ULTIMATE.start_main_~#t420~0.base_13| 0)) (= |v_ULTIMATE.start_main_~#t420~0.offset_11| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t420~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t420~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t420~0.base_13|) |v_ULTIMATE.start_main_~#t420~0.offset_11| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t420~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t420~0.base_13| 4)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t420~0.base_13| 1) |v_#valid_37|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t420~0.base=|v_ULTIMATE.start_main_~#t420~0.base_13|, ULTIMATE.start_main_~#t420~0.offset=|v_ULTIMATE.start_main_~#t420~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t420~0.base, ULTIMATE.start_main_~#t420~0.offset] because there is no mapped edge [2019-12-18 20:28:08,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P2ENTRY-->L4-3: Formula: (and (= 1 v_~y$w_buff0_used~0_97) (= 1 v_~y$w_buff0~0_20) (= (mod v_~y$w_buff1_used~0_55 256) 0) (= v_~y$w_buff0~0_21 v_~y$w_buff1~0_21) (= v_~y$w_buff1_used~0_55 v_~y$w_buff0_used~0_98) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff0~0=v_~y$w_buff0~0_21, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_21, ~y$w_buff0~0=v_~y$w_buff0~0_20, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_55} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:28:08,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L792-2-->L792-4: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-93376880 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-93376880 256)))) (or (and (= ~y$w_buff0~0_In-93376880 |P2Thread1of1ForFork0_#t~ite28_Out-93376880|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff1~0_In-93376880 |P2Thread1of1ForFork0_#t~ite28_Out-93376880|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-93376880, ~y$w_buff1~0=~y$w_buff1~0_In-93376880, ~y$w_buff0~0=~y$w_buff0~0_In-93376880, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-93376880} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-93376880|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-93376880, ~y$w_buff1~0=~y$w_buff1~0_In-93376880, ~y$w_buff0~0=~y$w_buff0~0_In-93376880, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-93376880} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 20:28:08,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L792-4-->L793: Formula: (= v_~y~0_20 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, ~y~0=v_~y~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-18 20:28:08,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [888] [888] L797-->L798: Formula: (and (= v_~y$r_buff0_thd3~0_55 v_~y$r_buff0_thd3~0_54) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_55, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_54, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 20:28:08,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In2121330412 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out2121330412| ~y~0_In2121330412)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out2121330412| ~y$mem_tmp~0_In2121330412)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In2121330412, ~y$flush_delayed~0=~y$flush_delayed~0_In2121330412, ~y~0=~y~0_In2121330412} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out2121330412|, ~y$mem_tmp~0=~y$mem_tmp~0_In2121330412, ~y$flush_delayed~0=~y$flush_delayed~0_In2121330412, ~y~0=~y~0_In2121330412} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-18 20:28:08,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_6) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 1 v_~z~0_7) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_6} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_7, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_6, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 20:28:08,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In285638203 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out285638203| ~y$mem_tmp~0_In285638203)) (and (= ~y~0_In285638203 |P1Thread1of1ForFork2_#t~ite25_Out285638203|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In285638203, ~y$flush_delayed~0=~y$flush_delayed~0_In285638203, ~y~0=~y~0_In285638203} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In285638203, ~y$flush_delayed~0=~y$flush_delayed~0_In285638203, ~y~0=~y~0_In285638203, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out285638203|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 20:28:08,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L763-2-->P1EXIT: Formula: (and (= 0 v_~y$flush_delayed~0_12) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite25_8| v_~y~0_25) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_25, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 20:28:08,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-2055987079 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2055987079 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-2055987079|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite51_Out-2055987079| ~y$w_buff0_used~0_In-2055987079)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2055987079, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2055987079} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2055987079, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2055987079, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-2055987079|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-18 20:28:08,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [949] [949] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In1753287064 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1753287064 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In1753287064 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1753287064 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out1753287064| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite52_Out1753287064| ~y$w_buff1_used~0_In1753287064)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1753287064, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1753287064, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1753287064, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1753287064} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1753287064, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1753287064, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1753287064, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1753287064|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1753287064} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-18 20:28:08,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L810-->L811: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In795414748 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In795414748 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In795414748 ~y$r_buff0_thd3~0_Out795414748)) (and (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out795414748) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In795414748, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In795414748} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In795414748, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out795414748, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out795414748|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-18 20:28:08,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-311934228 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-311934228 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-311934228 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-311934228 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-311934228|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In-311934228 |P2Thread1of1ForFork0_#t~ite54_Out-311934228|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-311934228, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-311934228, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-311934228, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-311934228} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-311934228, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-311934228, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-311934228|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-311934228, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-311934228} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-18 20:28:08,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_~y$r_buff1_thd3~0_31 |v_P2Thread1of1ForFork0_#t~ite54_8|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_31, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 20:28:08,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L838-->L840-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_103 256) 0) (= (mod v_~y$r_buff0_thd0~0_17 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 20:28:08,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L840-2-->L840-5: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-836638264 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-836638264 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite58_Out-836638264| |ULTIMATE.start_main_#t~ite59_Out-836638264|))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out-836638264| ~y$w_buff1~0_In-836638264) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite58_Out-836638264| ~y~0_In-836638264)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-836638264, ~y~0=~y~0_In-836638264, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-836638264, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-836638264} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-836638264, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-836638264|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-836638264|, ~y~0=~y~0_In-836638264, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-836638264, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-836638264} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 20:28:08,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1615926642 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1615926642 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out-1615926642|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1615926642 |ULTIMATE.start_main_#t~ite60_Out-1615926642|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1615926642, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1615926642} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1615926642|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1615926642, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1615926642} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-18 20:28:08,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L842-->L842-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In653133408 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In653133408 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In653133408 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In653133408 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In653133408 |ULTIMATE.start_main_#t~ite61_Out653133408|)) (and (= |ULTIMATE.start_main_#t~ite61_Out653133408| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In653133408, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In653133408, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In653133408, ~y$w_buff1_used~0=~y$w_buff1_used~0_In653133408} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out653133408|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In653133408, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In653133408, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In653133408, ~y$w_buff1_used~0=~y$w_buff1_used~0_In653133408} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 20:28:08,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1604928315 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1604928315 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite62_Out-1604928315| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out-1604928315| ~y$r_buff0_thd0~0_In-1604928315)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1604928315, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1604928315} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1604928315|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1604928315, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1604928315} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 20:28:08,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L844-->L844-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1078356476 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1078356476 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1078356476 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1078356476 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out1078356476| ~y$r_buff1_thd0~0_In1078356476) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite63_Out1078356476| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1078356476, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1078356476, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1078356476, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1078356476} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1078356476|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1078356476, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1078356476, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1078356476, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1078356476} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 20:28:08,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= 0 v_~__unbuffered_p1_EAX~0_8) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_~__unbuffered_p2_EBX~0_7 0) (= |v_ULTIMATE.start_main_#t~ite63_11| v_~y$r_buff1_thd0~0_17)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:28:09,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:28:09 BasicIcfg [2019-12-18 20:28:09,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:28:09,194 INFO L168 Benchmark]: Toolchain (without parser) took 72076.39 ms. Allocated memory was 146.3 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 101.2 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-18 20:28:09,194 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 20:28:09,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.38 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.8 MB in the beginning and 155.2 MB in the end (delta: -54.4 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-18 20:28:09,196 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.99 ms. Allocated memory is still 203.9 MB. Free memory was 155.2 MB in the beginning and 151.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 20:28:09,196 INFO L168 Benchmark]: Boogie Preprocessor took 43.90 ms. Allocated memory is still 203.9 MB. Free memory was 151.9 MB in the beginning and 149.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:28:09,197 INFO L168 Benchmark]: RCFGBuilder took 1009.74 ms. Allocated memory is still 203.9 MB. Free memory was 149.4 MB in the beginning and 94.6 MB in the end (delta: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:28:09,197 INFO L168 Benchmark]: TraceAbstraction took 70105.89 ms. Allocated memory was 203.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 94.0 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 967.1 MB. Max. memory is 7.1 GB. [2019-12-18 20:28:09,200 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 822.38 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.8 MB in the beginning and 155.2 MB in the end (delta: -54.4 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 88.99 ms. Allocated memory is still 203.9 MB. Free memory was 155.2 MB in the beginning and 151.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.90 ms. Allocated memory is still 203.9 MB. Free memory was 151.9 MB in the beginning and 149.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1009.74 ms. Allocated memory is still 203.9 MB. Free memory was 149.4 MB in the beginning and 94.6 MB in the end (delta: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 70105.89 ms. Allocated memory was 203.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 94.0 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 967.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 195 ProgramPointsBefore, 113 ProgramPointsAfterwards, 241 TransitionsBefore, 135 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 28 ChoiceCompositions, 9157 VarBasedMoverChecksPositive, 238 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 150396 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t418, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t419, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t420, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 y$flush_delayed = weak$$choice2 [L791] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L794] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L795] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 y = y$flush_delayed ? y$mem_tmp : y [L801] 3 y$flush_delayed = (_Bool)0 [L804] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 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) VAL [!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)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 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) [L756] 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] 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) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 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)) [L757] 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 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)) [L758] 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 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)) [L759] 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 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)) [L760] 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 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)) [L761] 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 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)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] 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) [L808] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L809] 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 [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L840] 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) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 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 [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 186 locations, 2 error locations. Result: UNSAFE, OverallTime: 69.6s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 21.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3769 SDtfs, 4268 SDslu, 6932 SDs, 0 SdLazy, 2554 SolverSat, 189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120690occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 36.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 74557 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 725 NumberOfCodeBlocks, 725 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 644 ConstructedInterpolants, 0 QuantifiedInterpolants, 99505 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...