/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix015_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:38:11,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:38:11,024 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:38:11,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:38:11,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:38:11,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:38:11,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:38:11,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:38:11,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:38:11,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:38:11,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:38:11,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:38:11,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:38:11,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:38:11,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:38:11,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:38:11,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:38:11,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:38:11,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:38:11,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:38:11,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:38:11,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:38:11,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:38:11,060 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:38:11,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:38:11,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:38:11,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:38:11,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:38:11,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:38:11,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:38:11,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:38:11,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:38:11,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:38:11,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:38:11,069 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:38:11,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:38:11,070 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:38:11,070 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:38:11,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:38:11,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:38:11,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:38:11,073 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:38:11,088 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:38:11,088 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:38:11,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:38:11,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:38:11,090 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:38:11,090 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:38:11,090 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:38:11,090 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:38:11,090 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:38:11,091 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:38:11,091 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:38:11,091 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:38:11,091 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:38:11,091 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:38:11,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:38:11,092 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:38:11,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:38:11,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:38:11,092 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:38:11,092 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:38:11,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:38:11,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:38:11,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:38:11,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:38:11,093 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:38:11,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:38:11,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:38:11,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:38:11,094 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:38:11,094 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:38:11,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:38:11,384 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:38:11,387 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:38:11,388 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:38:11,388 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:38:11,389 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015_tso.opt.i [2019-12-26 21:38:11,458 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8feeb20b/0ba965f63f984474a56b3042940a4f98/FLAG57b9dc9d7 [2019-12-26 21:38:12,027 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:38:12,027 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_tso.opt.i [2019-12-26 21:38:12,041 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8feeb20b/0ba965f63f984474a56b3042940a4f98/FLAG57b9dc9d7 [2019-12-26 21:38:12,320 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8feeb20b/0ba965f63f984474a56b3042940a4f98 [2019-12-26 21:38:12,330 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:38:12,332 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:38:12,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:38:12,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:38:12,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:38:12,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:38:12" (1/1) ... [2019-12-26 21:38:12,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:12, skipping insertion in model container [2019-12-26 21:38:12,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:38:12" (1/1) ... [2019-12-26 21:38:12,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:38:12,416 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:38:13,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:38:13,080 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:38:13,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:38:13,221 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:38:13,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:13 WrapperNode [2019-12-26 21:38:13,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:38:13,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:38:13,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:38:13,223 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:38:13,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:13" (1/1) ... [2019-12-26 21:38:13,254 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:13" (1/1) ... [2019-12-26 21:38:13,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:38:13,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:38:13,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:38:13,299 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:38:13,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:13" (1/1) ... [2019-12-26 21:38:13,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:13" (1/1) ... [2019-12-26 21:38:13,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:13" (1/1) ... [2019-12-26 21:38:13,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:13" (1/1) ... [2019-12-26 21:38:13,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:13" (1/1) ... [2019-12-26 21:38:13,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:13" (1/1) ... [2019-12-26 21:38:13,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:13" (1/1) ... [2019-12-26 21:38:13,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:38:13,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:38:13,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:38:13,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:38:13,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:13" (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-26 21:38:13,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:38:13,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:38:13,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:38:13,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:38:13,440 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:38:13,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:38:13,440 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:38:13,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:38:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:38:13,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:38:13,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:38:13,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:38:13,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:38:13,446 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:38:14,402 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:38:14,403 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:38:14,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:38:14 BoogieIcfgContainer [2019-12-26 21:38:14,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:38:14,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:38:14,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:38:14,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:38:14,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:38:12" (1/3) ... [2019-12-26 21:38:14,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a957e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:38:14, skipping insertion in model container [2019-12-26 21:38:14,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:13" (2/3) ... [2019-12-26 21:38:14,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a957e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:38:14, skipping insertion in model container [2019-12-26 21:38:14,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:38:14" (3/3) ... [2019-12-26 21:38:14,415 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_tso.opt.i [2019-12-26 21:38:14,429 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:38:14,429 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:38:14,442 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:38:14,443 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:38:14,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,522 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,522 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,524 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,525 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,565 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,565 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,566 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,576 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,576 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,602 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,603 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,604 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,610 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,610 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,615 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,617 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:14,633 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:38:14,649 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:38:14,649 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:38:14,649 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:38:14,649 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:38:14,649 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:38:14,649 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:38:14,649 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:38:14,650 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:38:14,665 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-26 21:38:14,667 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-26 21:38:14,786 INFO L132 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-26 21:38:14,786 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:38:14,805 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 560 event pairs. 0/182 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-26 21:38:14,837 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-26 21:38:14,904 INFO L132 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-26 21:38:14,904 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:38:14,919 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 560 event pairs. 0/182 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-26 21:38:14,955 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-26 21:38:14,956 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:38:21,328 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-26 21:38:21,459 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-26 21:38:21,502 INFO L206 etLargeBlockEncoding]: Checked pairs total: 124397 [2019-12-26 21:38:21,502 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-26 21:38:21,506 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 130 transitions [2019-12-26 21:38:25,272 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44886 states. [2019-12-26 21:38:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 44886 states. [2019-12-26 21:38:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 21:38:25,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:25,280 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:25,280 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-26 21:38:25,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:25,285 INFO L82 PathProgramCache]: Analyzing trace with hash -615654133, now seen corresponding path program 1 times [2019-12-26 21:38:25,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:25,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538805178] [2019-12-26 21:38:25,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:25,561 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-26 21:38:25,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538805178] [2019-12-26 21:38:25,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:25,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:38:25,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312976807] [2019-12-26 21:38:25,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:38:25,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:25,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:38:25,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:38:25,587 INFO L87 Difference]: Start difference. First operand 44886 states. Second operand 3 states. [2019-12-26 21:38:26,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:26,279 INFO L93 Difference]: Finished difference Result 44562 states and 182514 transitions. [2019-12-26 21:38:26,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:38:26,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-26 21:38:26,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:26,754 INFO L225 Difference]: With dead ends: 44562 [2019-12-26 21:38:26,754 INFO L226 Difference]: Without dead ends: 41502 [2019-12-26 21:38:26,756 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-26 21:38:28,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41502 states. [2019-12-26 21:38:29,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41502 to 41502. [2019-12-26 21:38:29,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41502 states. [2019-12-26 21:38:30,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41502 states to 41502 states and 169862 transitions. [2019-12-26 21:38:30,056 INFO L78 Accepts]: Start accepts. Automaton has 41502 states and 169862 transitions. Word has length 7 [2019-12-26 21:38:30,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:30,057 INFO L462 AbstractCegarLoop]: Abstraction has 41502 states and 169862 transitions. [2019-12-26 21:38:30,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:38:30,057 INFO L276 IsEmpty]: Start isEmpty. Operand 41502 states and 169862 transitions. [2019-12-26 21:38:30,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:38:30,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:30,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:30,064 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-26 21:38:30,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:30,065 INFO L82 PathProgramCache]: Analyzing trace with hash -42181455, now seen corresponding path program 1 times [2019-12-26 21:38:30,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:30,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565904070] [2019-12-26 21:38:30,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:30,226 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-26 21:38:30,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565904070] [2019-12-26 21:38:30,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:30,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:38:30,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869209193] [2019-12-26 21:38:30,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:38:30,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:30,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:38:30,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:38:30,230 INFO L87 Difference]: Start difference. First operand 41502 states and 169862 transitions. Second operand 4 states. [2019-12-26 21:38:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:31,817 INFO L93 Difference]: Finished difference Result 26491 states and 94929 transitions. [2019-12-26 21:38:31,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:38:31,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 21:38:31,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:31,995 INFO L225 Difference]: With dead ends: 26491 [2019-12-26 21:38:31,995 INFO L226 Difference]: Without dead ends: 23431 [2019-12-26 21:38:31,996 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-26 21:38:32,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23431 states. [2019-12-26 21:38:32,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23431 to 23431. [2019-12-26 21:38:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23431 states. [2019-12-26 21:38:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23431 states to 23431 states and 83897 transitions. [2019-12-26 21:38:33,117 INFO L78 Accepts]: Start accepts. Automaton has 23431 states and 83897 transitions. Word has length 13 [2019-12-26 21:38:33,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:33,117 INFO L462 AbstractCegarLoop]: Abstraction has 23431 states and 83897 transitions. [2019-12-26 21:38:33,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:38:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 23431 states and 83897 transitions. [2019-12-26 21:38:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 21:38:33,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:33,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:33,121 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-26 21:38:33,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:33,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1080804847, now seen corresponding path program 1 times [2019-12-26 21:38:33,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:33,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553454857] [2019-12-26 21:38:33,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:33,218 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-26 21:38:33,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553454857] [2019-12-26 21:38:33,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:33,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:38:33,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011791582] [2019-12-26 21:38:33,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:38:33,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:33,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:38:33,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:38:33,221 INFO L87 Difference]: Start difference. First operand 23431 states and 83897 transitions. Second operand 4 states. [2019-12-26 21:38:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:33,718 INFO L93 Difference]: Finished difference Result 35741 states and 122817 transitions. [2019-12-26 21:38:33,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:38:33,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 21:38:33,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:33,786 INFO L225 Difference]: With dead ends: 35741 [2019-12-26 21:38:33,786 INFO L226 Difference]: Without dead ends: 35726 [2019-12-26 21:38:33,786 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-26 21:38:34,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35726 states. [2019-12-26 21:38:35,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35726 to 34903. [2019-12-26 21:38:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34903 states. [2019-12-26 21:38:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34903 states to 34903 states and 120641 transitions. [2019-12-26 21:38:35,223 INFO L78 Accepts]: Start accepts. Automaton has 34903 states and 120641 transitions. Word has length 14 [2019-12-26 21:38:35,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:35,223 INFO L462 AbstractCegarLoop]: Abstraction has 34903 states and 120641 transitions. [2019-12-26 21:38:35,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:38:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 34903 states and 120641 transitions. [2019-12-26 21:38:35,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:38:35,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:35,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:35,226 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-26 21:38:35,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:35,226 INFO L82 PathProgramCache]: Analyzing trace with hash -902377345, now seen corresponding path program 1 times [2019-12-26 21:38:35,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:35,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380975411] [2019-12-26 21:38:35,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:35,329 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-26 21:38:35,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380975411] [2019-12-26 21:38:35,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:35,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:38:35,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328662079] [2019-12-26 21:38:35,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:38:35,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:35,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:38:35,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:38:35,332 INFO L87 Difference]: Start difference. First operand 34903 states and 120641 transitions. Second operand 4 states. [2019-12-26 21:38:35,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:35,827 INFO L93 Difference]: Finished difference Result 44765 states and 152243 transitions. [2019-12-26 21:38:35,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:38:35,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:38:35,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:35,907 INFO L225 Difference]: With dead ends: 44765 [2019-12-26 21:38:35,907 INFO L226 Difference]: Without dead ends: 44699 [2019-12-26 21:38:35,907 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-26 21:38:37,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44699 states. [2019-12-26 21:38:38,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44699 to 40201. [2019-12-26 21:38:38,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40201 states. [2019-12-26 21:38:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40201 states to 40201 states and 138191 transitions. [2019-12-26 21:38:38,469 INFO L78 Accepts]: Start accepts. Automaton has 40201 states and 138191 transitions. Word has length 16 [2019-12-26 21:38:38,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:38,469 INFO L462 AbstractCegarLoop]: Abstraction has 40201 states and 138191 transitions. [2019-12-26 21:38:38,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:38:38,470 INFO L276 IsEmpty]: Start isEmpty. Operand 40201 states and 138191 transitions. [2019-12-26 21:38:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 21:38:38,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:38,474 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-26 21:38:38,474 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-26 21:38:38,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:38,475 INFO L82 PathProgramCache]: Analyzing trace with hash -736056884, now seen corresponding path program 1 times [2019-12-26 21:38:38,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:38,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707684507] [2019-12-26 21:38:38,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:38,554 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-26 21:38:38,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707684507] [2019-12-26 21:38:38,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:38,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:38:38,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042913337] [2019-12-26 21:38:38,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:38:38,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:38,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:38:38,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:38:38,557 INFO L87 Difference]: Start difference. First operand 40201 states and 138191 transitions. Second operand 3 states. [2019-12-26 21:38:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:38,952 INFO L93 Difference]: Finished difference Result 37897 states and 130073 transitions. [2019-12-26 21:38:38,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:38:38,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-26 21:38:38,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:39,024 INFO L225 Difference]: With dead ends: 37897 [2019-12-26 21:38:39,024 INFO L226 Difference]: Without dead ends: 37897 [2019-12-26 21:38:39,024 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-26 21:38:39,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37897 states. [2019-12-26 21:38:40,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37897 to 37897. [2019-12-26 21:38:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37897 states. [2019-12-26 21:38:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37897 states to 37897 states and 130073 transitions. [2019-12-26 21:38:40,200 INFO L78 Accepts]: Start accepts. Automaton has 37897 states and 130073 transitions. Word has length 19 [2019-12-26 21:38:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:40,200 INFO L462 AbstractCegarLoop]: Abstraction has 37897 states and 130073 transitions. [2019-12-26 21:38:40,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:38:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 37897 states and 130073 transitions. [2019-12-26 21:38:40,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-26 21:38:40,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:40,215 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-26 21:38:40,216 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-26 21:38:40,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:40,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1471479395, now seen corresponding path program 1 times [2019-12-26 21:38:40,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:40,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039698808] [2019-12-26 21:38:40,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:40,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-26 21:38:40,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039698808] [2019-12-26 21:38:40,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:40,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:38:40,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755252989] [2019-12-26 21:38:40,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:38:40,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:40,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:38:40,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:38:40,297 INFO L87 Difference]: Start difference. First operand 37897 states and 130073 transitions. Second operand 5 states. [2019-12-26 21:38:41,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:41,067 INFO L93 Difference]: Finished difference Result 44903 states and 151795 transitions. [2019-12-26 21:38:41,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:38:41,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-26 21:38:41,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:41,149 INFO L225 Difference]: With dead ends: 44903 [2019-12-26 21:38:41,149 INFO L226 Difference]: Without dead ends: 44876 [2019-12-26 21:38:41,150 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-26 21:38:41,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44876 states. [2019-12-26 21:38:42,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44876 to 37931. [2019-12-26 21:38:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37931 states. [2019-12-26 21:38:42,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37931 states to 37931 states and 130187 transitions. [2019-12-26 21:38:42,551 INFO L78 Accepts]: Start accepts. Automaton has 37931 states and 130187 transitions. Word has length 23 [2019-12-26 21:38:42,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:42,551 INFO L462 AbstractCegarLoop]: Abstraction has 37931 states and 130187 transitions. [2019-12-26 21:38:42,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:38:42,552 INFO L276 IsEmpty]: Start isEmpty. Operand 37931 states and 130187 transitions. [2019-12-26 21:38:42,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:38:42,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:42,597 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] [2019-12-26 21:38:42,598 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-26 21:38:42,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:42,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1501647613, now seen corresponding path program 1 times [2019-12-26 21:38:42,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:42,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863398426] [2019-12-26 21:38:42,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:42,666 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-26 21:38:42,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863398426] [2019-12-26 21:38:42,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:42,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:38:42,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104028804] [2019-12-26 21:38:42,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:38:42,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:42,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:38:42,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:38:42,669 INFO L87 Difference]: Start difference. First operand 37931 states and 130187 transitions. Second operand 5 states. [2019-12-26 21:38:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:43,021 INFO L93 Difference]: Finished difference Result 57698 states and 201251 transitions. [2019-12-26 21:38:43,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:38:43,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-26 21:38:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:43,691 INFO L225 Difference]: With dead ends: 57698 [2019-12-26 21:38:43,691 INFO L226 Difference]: Without dead ends: 50142 [2019-12-26 21:38:43,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:38:44,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50142 states. [2019-12-26 21:38:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50142 to 50142. [2019-12-26 21:38:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50142 states. [2019-12-26 21:38:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50142 states to 50142 states and 175482 transitions. [2019-12-26 21:38:45,455 INFO L78 Accepts]: Start accepts. Automaton has 50142 states and 175482 transitions. Word has length 33 [2019-12-26 21:38:45,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:45,455 INFO L462 AbstractCegarLoop]: Abstraction has 50142 states and 175482 transitions. [2019-12-26 21:38:45,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:38:45,455 INFO L276 IsEmpty]: Start isEmpty. Operand 50142 states and 175482 transitions. [2019-12-26 21:38:45,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:38:45,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:45,524 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] [2019-12-26 21:38:45,524 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-26 21:38:45,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:45,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1577527187, now seen corresponding path program 2 times [2019-12-26 21:38:45,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:45,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607626901] [2019-12-26 21:38:45,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:45,605 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-26 21:38:45,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607626901] [2019-12-26 21:38:45,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:45,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:38:45,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180420423] [2019-12-26 21:38:45,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:38:45,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:45,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:38:45,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:38:45,608 INFO L87 Difference]: Start difference. First operand 50142 states and 175482 transitions. Second operand 5 states. [2019-12-26 21:38:45,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:45,698 INFO L93 Difference]: Finished difference Result 11230 states and 34693 transitions. [2019-12-26 21:38:45,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:38:45,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-26 21:38:45,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:45,710 INFO L225 Difference]: With dead ends: 11230 [2019-12-26 21:38:45,711 INFO L226 Difference]: Without dead ends: 7932 [2019-12-26 21:38:45,711 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-26 21:38:45,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7932 states. [2019-12-26 21:38:45,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7932 to 7932. [2019-12-26 21:38:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7932 states. [2019-12-26 21:38:45,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7932 states to 7932 states and 23166 transitions. [2019-12-26 21:38:45,806 INFO L78 Accepts]: Start accepts. Automaton has 7932 states and 23166 transitions. Word has length 33 [2019-12-26 21:38:45,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:45,807 INFO L462 AbstractCegarLoop]: Abstraction has 7932 states and 23166 transitions. [2019-12-26 21:38:45,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:38:45,807 INFO L276 IsEmpty]: Start isEmpty. Operand 7932 states and 23166 transitions. [2019-12-26 21:38:45,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-26 21:38:45,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:45,819 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] [2019-12-26 21:38:45,819 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-26 21:38:45,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:45,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1037998465, now seen corresponding path program 1 times [2019-12-26 21:38:45,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:45,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846823493] [2019-12-26 21:38:45,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:45,887 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-26 21:38:45,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846823493] [2019-12-26 21:38:45,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:45,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:38:45,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288070240] [2019-12-26 21:38:45,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:38:45,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:45,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:38:45,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:38:45,889 INFO L87 Difference]: Start difference. First operand 7932 states and 23166 transitions. Second operand 4 states. [2019-12-26 21:38:45,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:45,936 INFO L93 Difference]: Finished difference Result 9099 states and 25843 transitions. [2019-12-26 21:38:45,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:38:45,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-26 21:38:45,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:45,953 INFO L225 Difference]: With dead ends: 9099 [2019-12-26 21:38:45,953 INFO L226 Difference]: Without dead ends: 7943 [2019-12-26 21:38:45,954 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-26 21:38:45,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7943 states. [2019-12-26 21:38:46,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7943 to 7927. [2019-12-26 21:38:46,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7927 states. [2019-12-26 21:38:46,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7927 states to 7927 states and 23085 transitions. [2019-12-26 21:38:46,120 INFO L78 Accepts]: Start accepts. Automaton has 7927 states and 23085 transitions. Word has length 45 [2019-12-26 21:38:46,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:46,120 INFO L462 AbstractCegarLoop]: Abstraction has 7927 states and 23085 transitions. [2019-12-26 21:38:46,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:38:46,120 INFO L276 IsEmpty]: Start isEmpty. Operand 7927 states and 23085 transitions. [2019-12-26 21:38:46,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-26 21:38:46,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:46,132 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] [2019-12-26 21:38:46,132 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-26 21:38:46,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:46,133 INFO L82 PathProgramCache]: Analyzing trace with hash -366523869, now seen corresponding path program 2 times [2019-12-26 21:38:46,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:46,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013901787] [2019-12-26 21:38:46,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:46,218 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-26 21:38:46,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013901787] [2019-12-26 21:38:46,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:46,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:38:46,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408169020] [2019-12-26 21:38:46,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:38:46,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:46,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:38:46,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:38:46,220 INFO L87 Difference]: Start difference. First operand 7927 states and 23085 transitions. Second operand 5 states. [2019-12-26 21:38:46,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:46,688 INFO L93 Difference]: Finished difference Result 8909 states and 25518 transitions. [2019-12-26 21:38:46,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:38:46,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-26 21:38:46,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:46,704 INFO L225 Difference]: With dead ends: 8909 [2019-12-26 21:38:46,705 INFO L226 Difference]: Without dead ends: 8909 [2019-12-26 21:38:46,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:38:46,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8909 states. [2019-12-26 21:38:46,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8909 to 8665. [2019-12-26 21:38:46,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8665 states. [2019-12-26 21:38:46,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8665 states to 8665 states and 25010 transitions. [2019-12-26 21:38:46,860 INFO L78 Accepts]: Start accepts. Automaton has 8665 states and 25010 transitions. Word has length 45 [2019-12-26 21:38:46,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:46,860 INFO L462 AbstractCegarLoop]: Abstraction has 8665 states and 25010 transitions. [2019-12-26 21:38:46,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:38:46,861 INFO L276 IsEmpty]: Start isEmpty. Operand 8665 states and 25010 transitions. [2019-12-26 21:38:46,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-26 21:38:46,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:46,870 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] [2019-12-26 21:38:46,871 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-26 21:38:46,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:46,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1047489597, now seen corresponding path program 1 times [2019-12-26 21:38:46,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:46,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35009579] [2019-12-26 21:38:46,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:46,982 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-26 21:38:46,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35009579] [2019-12-26 21:38:46,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:46,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:38:46,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137974517] [2019-12-26 21:38:46,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:38:46,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:46,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:38:46,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:38:46,984 INFO L87 Difference]: Start difference. First operand 8665 states and 25010 transitions. Second operand 6 states. [2019-12-26 21:38:47,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:47,095 INFO L93 Difference]: Finished difference Result 7199 states and 21483 transitions. [2019-12-26 21:38:47,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:38:47,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-12-26 21:38:47,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:47,104 INFO L225 Difference]: With dead ends: 7199 [2019-12-26 21:38:47,104 INFO L226 Difference]: Without dead ends: 4310 [2019-12-26 21:38:47,105 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-26 21:38:47,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4310 states. [2019-12-26 21:38:47,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4310 to 4102. [2019-12-26 21:38:47,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2019-12-26 21:38:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 10920 transitions. [2019-12-26 21:38:47,166 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 10920 transitions. Word has length 46 [2019-12-26 21:38:47,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:47,166 INFO L462 AbstractCegarLoop]: Abstraction has 4102 states and 10920 transitions. [2019-12-26 21:38:47,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:38:47,166 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 10920 transitions. [2019-12-26 21:38:47,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-26 21:38:47,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:47,171 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-26 21:38:47,171 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-26 21:38:47,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:47,171 INFO L82 PathProgramCache]: Analyzing trace with hash -717724991, now seen corresponding path program 1 times [2019-12-26 21:38:47,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:47,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724771775] [2019-12-26 21:38:47,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:47,260 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-26 21:38:47,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724771775] [2019-12-26 21:38:47,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:47,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:38:47,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141621401] [2019-12-26 21:38:47,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:38:47,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:47,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:38:47,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:38:47,262 INFO L87 Difference]: Start difference. First operand 4102 states and 10920 transitions. Second operand 6 states. [2019-12-26 21:38:47,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:47,894 INFO L93 Difference]: Finished difference Result 7954 states and 21361 transitions. [2019-12-26 21:38:47,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:38:47,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-26 21:38:47,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:47,905 INFO L225 Difference]: With dead ends: 7954 [2019-12-26 21:38:47,906 INFO L226 Difference]: Without dead ends: 6549 [2019-12-26 21:38:47,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:38:47,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6549 states. [2019-12-26 21:38:48,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6549 to 4527. [2019-12-26 21:38:48,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4527 states. [2019-12-26 21:38:48,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4527 states to 4527 states and 11970 transitions. [2019-12-26 21:38:48,015 INFO L78 Accepts]: Start accepts. Automaton has 4527 states and 11970 transitions. Word has length 61 [2019-12-26 21:38:48,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:48,016 INFO L462 AbstractCegarLoop]: Abstraction has 4527 states and 11970 transitions. [2019-12-26 21:38:48,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:38:48,016 INFO L276 IsEmpty]: Start isEmpty. Operand 4527 states and 11970 transitions. [2019-12-26 21:38:48,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-26 21:38:48,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:48,024 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-26 21:38:48,024 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-26 21:38:48,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:48,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1098348301, now seen corresponding path program 1 times [2019-12-26 21:38:48,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:48,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867253615] [2019-12-26 21:38:48,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:48,127 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-26 21:38:48,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867253615] [2019-12-26 21:38:48,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:48,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:38:48,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252315024] [2019-12-26 21:38:48,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:38:48,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:48,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:38:48,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:38:48,130 INFO L87 Difference]: Start difference. First operand 4527 states and 11970 transitions. Second operand 4 states. [2019-12-26 21:38:48,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:48,160 INFO L93 Difference]: Finished difference Result 5181 states and 13422 transitions. [2019-12-26 21:38:48,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:38:48,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-26 21:38:48,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:48,162 INFO L225 Difference]: With dead ends: 5181 [2019-12-26 21:38:48,162 INFO L226 Difference]: Without dead ends: 735 [2019-12-26 21:38:48,166 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-26 21:38:48,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-12-26 21:38:48,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2019-12-26 21:38:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2019-12-26 21:38:48,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1583 transitions. [2019-12-26 21:38:48,176 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1583 transitions. Word has length 62 [2019-12-26 21:38:48,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:48,176 INFO L462 AbstractCegarLoop]: Abstraction has 735 states and 1583 transitions. [2019-12-26 21:38:48,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:38:48,177 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1583 transitions. [2019-12-26 21:38:48,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-26 21:38:48,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:48,178 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-26 21:38:48,178 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-26 21:38:48,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:48,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1723127799, now seen corresponding path program 1 times [2019-12-26 21:38:48,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:48,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123747761] [2019-12-26 21:38:48,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:48,284 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-26 21:38:48,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123747761] [2019-12-26 21:38:48,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:48,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:38:48,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496675945] [2019-12-26 21:38:48,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:38:48,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:48,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:38:48,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:38:48,286 INFO L87 Difference]: Start difference. First operand 735 states and 1583 transitions. Second operand 8 states. [2019-12-26 21:38:48,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:48,584 INFO L93 Difference]: Finished difference Result 1387 states and 2929 transitions. [2019-12-26 21:38:48,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:38:48,585 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-12-26 21:38:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:48,586 INFO L225 Difference]: With dead ends: 1387 [2019-12-26 21:38:48,586 INFO L226 Difference]: Without dead ends: 1012 [2019-12-26 21:38:48,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:38:48,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2019-12-26 21:38:48,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 808. [2019-12-26 21:38:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-12-26 21:38:48,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1712 transitions. [2019-12-26 21:38:48,601 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1712 transitions. Word has length 62 [2019-12-26 21:38:48,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:48,602 INFO L462 AbstractCegarLoop]: Abstraction has 808 states and 1712 transitions. [2019-12-26 21:38:48,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:38:48,603 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1712 transitions. [2019-12-26 21:38:48,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-26 21:38:48,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:48,605 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-26 21:38:48,605 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-26 21:38:48,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:48,605 INFO L82 PathProgramCache]: Analyzing trace with hash -2098975229, now seen corresponding path program 2 times [2019-12-26 21:38:48,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:48,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362365600] [2019-12-26 21:38:48,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:48,718 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-26 21:38:48,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362365600] [2019-12-26 21:38:48,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:48,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:38:48,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644161509] [2019-12-26 21:38:48,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:38:48,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:48,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:38:48,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:38:48,720 INFO L87 Difference]: Start difference. First operand 808 states and 1712 transitions. Second operand 6 states. [2019-12-26 21:38:49,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:49,140 INFO L93 Difference]: Finished difference Result 930 states and 1951 transitions. [2019-12-26 21:38:49,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:38:49,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-26 21:38:49,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:49,142 INFO L225 Difference]: With dead ends: 930 [2019-12-26 21:38:49,142 INFO L226 Difference]: Without dead ends: 930 [2019-12-26 21:38:49,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-26 21:38:49,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2019-12-26 21:38:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 814. [2019-12-26 21:38:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2019-12-26 21:38:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1723 transitions. [2019-12-26 21:38:49,151 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1723 transitions. Word has length 62 [2019-12-26 21:38:49,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:49,152 INFO L462 AbstractCegarLoop]: Abstraction has 814 states and 1723 transitions. [2019-12-26 21:38:49,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:38:49,152 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1723 transitions. [2019-12-26 21:38:49,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-26 21:38:49,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:49,153 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-26 21:38:49,153 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-26 21:38:49,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:49,153 INFO L82 PathProgramCache]: Analyzing trace with hash -991702007, now seen corresponding path program 3 times [2019-12-26 21:38:49,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:49,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892373345] [2019-12-26 21:38:49,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:49,223 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-26 21:38:49,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892373345] [2019-12-26 21:38:49,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:49,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:38:49,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426991537] [2019-12-26 21:38:49,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:38:49,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:49,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:38:49,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:38:49,225 INFO L87 Difference]: Start difference. First operand 814 states and 1723 transitions. Second operand 3 states. [2019-12-26 21:38:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:49,236 INFO L93 Difference]: Finished difference Result 814 states and 1722 transitions. [2019-12-26 21:38:49,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:38:49,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-26 21:38:49,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:49,238 INFO L225 Difference]: With dead ends: 814 [2019-12-26 21:38:49,238 INFO L226 Difference]: Without dead ends: 814 [2019-12-26 21:38:49,238 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-26 21:38:49,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-12-26 21:38:49,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 768. [2019-12-26 21:38:49,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-12-26 21:38:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1644 transitions. [2019-12-26 21:38:49,248 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1644 transitions. Word has length 62 [2019-12-26 21:38:49,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:49,248 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 1644 transitions. [2019-12-26 21:38:49,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:38:49,249 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1644 transitions. [2019-12-26 21:38:49,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 21:38:49,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:49,250 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-26 21:38:49,250 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-26 21:38:49,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:49,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1081093091, now seen corresponding path program 1 times [2019-12-26 21:38:49,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:49,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867821314] [2019-12-26 21:38:49,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:38:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:38:49,420 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:38:49,420 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:38:49,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_148| 0 0))) (and (= v_~z$r_buff0_thd1~0_163 0) (= v_~z$r_buff1_thd1~0_231 0) (= 0 v_~__unbuffered_p2_EAX~0_94) (= v_~weak$$choice2~0_336 0) (= v_~z$r_buff1_thd2~0_450 0) (= v_~main$tmp_guard0~0_29 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t406~0.base_114|) (= v_~z$w_buff0~0_389 0) (= v_~main$tmp_guard1~0_78 0) (= v_~y~0_48 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t406~0.base_114| 4) |v_#length_25|) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~__unbuffered_p0_EBX~0_85 0) (= v_~z$w_buff1~0_275 0) (= 0 v_~z$r_buff0_thd3~0_641) (= 0 v_~__unbuffered_p1_EAX~0_94) (= v_~__unbuffered_cnt~0_142 0) (= v_~z$w_buff1_used~0_552 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t406~0.base_114| 1) |v_#valid_146|) (= v_~z$r_buff1_thd0~0_338 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= v_~z$r_buff0_thd0~0_222 0) (= 0 v_~weak$$choice0~0_260) (= |v_#NULL.offset_5| 0) (= v_~z~0_393 0) (= 0 v_~z$r_buff1_thd3~0_405) (= 0 |v_ULTIMATE.start_main_~#t406~0.offset_64|) (= v_~__unbuffered_p2_EBX~0_87 0) (= v_~z$r_buff0_thd2~0_459 0) (= v_~a~0_33 0) (= 0 v_~z$flush_delayed~0_341) (= 0 v_~z$mem_tmp~0_277) (= v_~x~0_19 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t406~0.base_114|) 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t406~0.base_114| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t406~0.base_114|) |v_ULTIMATE.start_main_~#t406~0.offset_64| 0))) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff0_used~0_978 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_16|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_~#t408~0.base=|v_ULTIMATE.start_main_~#t408~0.base_63|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_450, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t408~0.offset=|v_ULTIMATE.start_main_~#t408~0.offset_38|, ~a~0=v_~a~0_33, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_222, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_94, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_94, ~z$mem_tmp~0=v_~z$mem_tmp~0_277, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_87, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_57|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_552, ~z$flush_delayed~0=v_~z$flush_delayed~0_341, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_159|, ~weak$$choice0~0=v_~weak$$choice0~0_260, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_33|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_231, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_641, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142, ULTIMATE.start_main_~#t407~0.offset=|v_ULTIMATE.start_main_~#t407~0.offset_38|, ~x~0=v_~x~0_19, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_78, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t406~0.offset=|v_ULTIMATE.start_main_~#t406~0.offset_64|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_338, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_459, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_978, ~z$w_buff0~0=v_~z$w_buff0~0_389, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_88|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t407~0.base=|v_ULTIMATE.start_main_~#t407~0.base_87|, ULTIMATE.start_main_~#t406~0.base=|v_ULTIMATE.start_main_~#t406~0.base_114|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_29|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_371|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_63|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_393, ~weak$$choice2~0=v_~weak$$choice2~0_336, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_163} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t408~0.base, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t408~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t407~0.offset, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t406~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t407~0.base, ULTIMATE.start_main_~#t406~0.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:38:49,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L840-1-->L842: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t407~0.base_11|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t407~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t407~0.offset_10|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t407~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t407~0.base_11|) |v_ULTIMATE.start_main_~#t407~0.offset_10| 1))) (not (= |v_ULTIMATE.start_main_~#t407~0.base_11| 0)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t407~0.base_11| 4) |v_#length_15|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t407~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t407~0.offset=|v_ULTIMATE.start_main_~#t407~0.offset_10|, ULTIMATE.start_main_~#t407~0.base=|v_ULTIMATE.start_main_~#t407~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t407~0.offset, ULTIMATE.start_main_~#t407~0.base] because there is no mapped edge [2019-12-26 21:38:49,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L842-1-->L844: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t408~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t408~0.base_11|) |v_ULTIMATE.start_main_~#t408~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t408~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t408~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t408~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t408~0.offset_10|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t408~0.base_11| 4)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t408~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t408~0.base=|v_ULTIMATE.start_main_~#t408~0.base_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t408~0.offset=|v_ULTIMATE.start_main_~#t408~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t408~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t408~0.offset, #length] because there is no mapped edge [2019-12-26 21:38:49,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] P2ENTRY-->L4-3: Formula: (and (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_71 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_69|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_69| v_P2Thread1of1ForFork0_~arg.offset_69) (= v_~z$w_buff0_used~0_347 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_69| v_P2Thread1of1ForFork0_~arg.base_69) (= (mod v_~z$w_buff1_used~0_200 256) 0) (= v_~z$w_buff0_used~0_348 v_~z$w_buff1_used~0_200) (= v_~z$w_buff0~0_158 v_~z$w_buff1~0_95) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_69|) (= v_~z$w_buff0~0_157 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_348, ~z$w_buff0~0=v_~z$w_buff0~0_158, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_69, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_69|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_347, ~z$w_buff0~0=v_~z$w_buff0~0_157, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_69, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_200, ~z$w_buff1~0=v_~z$w_buff1~0_95, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_71} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 21:38:49,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In52885536 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In52885536 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out52885536| ~z$w_buff0~0_In52885536) (not .cse0) (not .cse1)) (and (= ~z$w_buff1~0_In52885536 |P2Thread1of1ForFork0_#t~ite28_Out52885536|) (or .cse1 .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In52885536, ~z$w_buff0_used~0=~z$w_buff0_used~0_In52885536, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In52885536, ~z$w_buff1~0=~z$w_buff1~0_In52885536} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out52885536|, ~z$w_buff0~0=~z$w_buff0~0_In52885536, ~z$w_buff0_used~0=~z$w_buff0_used~0_In52885536, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In52885536, ~z$w_buff1~0=~z$w_buff1~0_In52885536} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-26 21:38:49,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L802-4-->L803: Formula: (= v_~z~0_26 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, ~z~0=v_~z~0_26, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, ~z~0, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 21:38:49,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L807-->L808: Formula: (and (not (= (mod v_~weak$$choice2~0_43 256) 0)) (= v_~z$r_buff0_thd3~0_66 v_~z$r_buff0_thd3~0_65)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_43} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_7|, ~weak$$choice2~0=v_~weak$$choice2~0_43} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 21:38:49,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-695480007 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-695480007| ~z~0_In-695480007) .cse0) (and (= |P2Thread1of1ForFork0_#t~ite48_Out-695480007| ~z$mem_tmp~0_In-695480007) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-695480007, ~z$flush_delayed~0=~z$flush_delayed~0_In-695480007, ~z~0=~z~0_In-695480007} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-695480007|, ~z$mem_tmp~0=~z$mem_tmp~0_In-695480007, ~z$flush_delayed~0=~z$flush_delayed~0_In-695480007, ~z~0=~z~0_In-695480007} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-26 21:38:49,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_12 |v_P0Thread1of1ForFork1_#in~arg.offset_12|) (= v_~__unbuffered_p0_EBX~0_19 v_~y~0_40) (= |v_P0Thread1of1ForFork1_#in~arg.base_12| v_P0Thread1of1ForFork1_~arg.base_12) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~x~0_13 v_~__unbuffered_p0_EAX~0_19) (= v_~x~0_13 1) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= v_~a~0_17 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_12|, ~y~0=v_~y~0_40} OutVars{~a~0=v_~a~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_12|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_12|, ~y~0=v_~y~0_40, ~x~0=v_~x~0_13, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_12} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-26 21:38:49,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-403496901 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-403496901 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out-403496901| 0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite51_Out-403496901| ~z$w_buff0_used~0_In-403496901) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-403496901, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-403496901} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-403496901, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-403496901, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-403496901|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-26 21:38:49,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1197117208 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1197117208 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1197117208 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1197117208 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1197117208| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite52_Out-1197117208| ~z$w_buff1_used~0_In-1197117208) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1197117208, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1197117208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1197117208, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1197117208} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1197117208, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1197117208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1197117208, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1197117208|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1197117208} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-26 21:38:49,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L820-->L821: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In377079907 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In377079907 256) 0))) (or (and (not .cse0) (= ~z$r_buff0_thd3~0_Out377079907 0) (not .cse1)) (and (= ~z$r_buff0_thd3~0_Out377079907 ~z$r_buff0_thd3~0_In377079907) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In377079907, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In377079907} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In377079907, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out377079907, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out377079907|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-26 21:38:49,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L821-->L821-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In18441492 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In18441492 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In18441492 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In18441492 256) 0))) (or (and (= ~z$r_buff1_thd3~0_In18441492 |P2Thread1of1ForFork0_#t~ite54_Out18441492|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite54_Out18441492| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In18441492, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In18441492, ~z$w_buff1_used~0=~z$w_buff1_used~0_In18441492, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In18441492} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In18441492, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out18441492|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In18441492, ~z$w_buff1_used~0=~z$w_buff1_used~0_In18441492, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In18441492} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-26 21:38:49,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite54_38|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_37|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 21:38:49,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1205190008 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-1205190008| ~z$mem_tmp~0_In-1205190008) (not .cse0)) (and .cse0 (= ~z~0_In-1205190008 |P1Thread1of1ForFork2_#t~ite25_Out-1205190008|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1205190008, ~z$flush_delayed~0=~z$flush_delayed~0_In-1205190008, ~z~0=~z~0_In-1205190008} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1205190008, ~z$flush_delayed~0=~z$flush_delayed~0_In-1205190008, ~z~0=~z~0_In-1205190008, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1205190008|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-26 21:38:49,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L773-2-->P1EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_267) (= v_~z~0_239 |v_P1Thread1of1ForFork2_#t~ite25_94|) (= v_~__unbuffered_cnt~0_117 (+ v_~__unbuffered_cnt~0_118 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_94|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ~z$flush_delayed~0=v_~z$flush_delayed~0_267, ~z~0=v_~z~0_239, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_93|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-26 21:38:49,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [897] [897] L848-->L850-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~z$r_buff0_thd0~0_30 256) 0) (= 0 (mod v_~z$w_buff0_used~0_165 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_30, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_165, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_30, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_165, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 21:38:49,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L850-2-->L850-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out-1050007671| |ULTIMATE.start_main_#t~ite58_Out-1050007671|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1050007671 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1050007671 256)))) (or (and .cse0 (not .cse1) (= ~z$w_buff1~0_In-1050007671 |ULTIMATE.start_main_#t~ite58_Out-1050007671|) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~z~0_In-1050007671 |ULTIMATE.start_main_#t~ite58_Out-1050007671|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1050007671, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1050007671, ~z$w_buff1~0=~z$w_buff1~0_In-1050007671, ~z~0=~z~0_In-1050007671} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1050007671, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1050007671|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1050007671, ~z$w_buff1~0=~z$w_buff1~0_In-1050007671, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1050007671|, ~z~0=~z~0_In-1050007671} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-26 21:38:49,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In911284010 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In911284010 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite60_Out911284010| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In911284010 |ULTIMATE.start_main_#t~ite60_Out911284010|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In911284010, ~z$w_buff0_used~0=~z$w_buff0_used~0_In911284010} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out911284010|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In911284010, ~z$w_buff0_used~0=~z$w_buff0_used~0_In911284010} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-26 21:38:49,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In991413464 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In991413464 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In991413464 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In991413464 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite61_Out991413464| 0)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In991413464 |ULTIMATE.start_main_#t~ite61_Out991413464|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In991413464, ~z$w_buff0_used~0=~z$w_buff0_used~0_In991413464, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In991413464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In991413464} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In991413464, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out991413464|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In991413464, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In991413464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In991413464} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-26 21:38:49,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1889661399 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1889661399 256)))) (or (and (= ~z$r_buff0_thd0~0_In-1889661399 |ULTIMATE.start_main_#t~ite62_Out-1889661399|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite62_Out-1889661399| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1889661399, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1889661399} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1889661399|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1889661399, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1889661399} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-26 21:38:49,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-216770968 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-216770968 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-216770968 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-216770968 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-216770968|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-216770968 |ULTIMATE.start_main_#t~ite63_Out-216770968|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-216770968, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-216770968, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-216770968, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-216770968} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-216770968|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-216770968, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-216770968, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-216770968, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-216770968} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-26 21:38:49,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_22 256)) (= v_~__unbuffered_p0_EBX~0_30 0) (= v_~z$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite63_47|) (= 1 v_~__unbuffered_p0_EAX~0_30) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= v_~__unbuffered_p2_EBX~0_26 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= 1 v_~__unbuffered_p2_EAX~0_22) (= v_~main$tmp_guard1~0_22 0)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:38:49,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:38:49 BasicIcfg [2019-12-26 21:38:49,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:38:49,617 INFO L168 Benchmark]: Toolchain (without parser) took 37286.20 ms. Allocated memory was 144.2 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 100.1 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 458.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:38:49,618 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 21:38:49,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 888.81 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 99.9 MB in the beginning and 153.4 MB in the end (delta: -53.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:38:49,619 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.91 ms. Allocated memory is still 200.8 MB. Free memory was 153.4 MB in the beginning and 150.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 21:38:49,624 INFO L168 Benchmark]: Boogie Preprocessor took 40.26 ms. Allocated memory is still 200.8 MB. Free memory was 150.6 MB in the beginning and 147.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:38:49,624 INFO L168 Benchmark]: RCFGBuilder took 1064.70 ms. Allocated memory is still 200.8 MB. Free memory was 147.9 MB in the beginning and 92.4 MB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. [2019-12-26 21:38:49,625 INFO L168 Benchmark]: TraceAbstraction took 35207.95 ms. Allocated memory was 200.8 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 91.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 393.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:38:49,632 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.24 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 888.81 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 99.9 MB in the beginning and 153.4 MB in the end (delta: -53.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.91 ms. Allocated memory is still 200.8 MB. Free memory was 153.4 MB in the beginning and 150.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.26 ms. Allocated memory is still 200.8 MB. Free memory was 150.6 MB in the beginning and 147.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1064.70 ms. Allocated memory is still 200.8 MB. Free memory was 147.9 MB in the beginning and 92.4 MB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35207.95 ms. Allocated memory was 200.8 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 91.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 393.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.8s, 197 ProgramPointsBefore, 108 ProgramPointsAfterwards, 243 TransitionsBefore, 130 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 28 ChoiceCompositions, 9454 VarBasedMoverChecksPositive, 317 VarBasedMoverChecksNegative, 92 SemBasedMoverChecksPositive, 331 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 0 MoverChecksTotal, 124397 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t406, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] FCALL, FORK 0 pthread_create(&t407, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] FCALL, FORK 0 pthread_create(&t408, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L792] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L793] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L794] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L795] 3 z$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L805] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L806] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 y = 1 [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EAX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L851] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L852] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L853] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 34.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3289 SDtfs, 4171 SDslu, 5953 SDs, 0 SdLazy, 1988 SolverSat, 118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50142occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 15122 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 666 NumberOfCodeBlocks, 666 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 587 ConstructedInterpolants, 0 QuantifiedInterpolants, 82107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...